{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T04:11:54Z","timestamp":1687320714159},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Combinatorics","license":[{"start":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T00:00:00Z","timestamp":1651795200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"Let $P$ be a set of $n\\geq 3$ points in general position in the plane. The\nedge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the\nclosed straight line segments with endpoints in $P$, two of which are adjacent\nin $D(P)$ if and only if they are disjoint. We show that the connectivity of\n$D(P)$ is at least\n$\\binom{\\lfloor\\frac{n-2}{2}\\rfloor}{2}+\\binom{\\lceil\\frac{n-2}{2}\\rceil}{2}$,\nand that this bound is tight for each $n\\geq 3$.<\/jats:p>","DOI":"10.46298\/dmtcs.6678","type":"journal-article","created":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T15:33:03Z","timestamp":1651851183000},"source":"Crossref","is-referenced-by-count":0,"title":["On the connectivity of the disjointness graph of segments of point sets in general position in the plane"],"prefix":"10.46298","volume":"vol. 24, no. 1","author":[{"given":"J.","family":"Lea\u00f1os","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2702-9981","authenticated-orcid":false,"given":"Christophe","family":"Ndjatchi","sequence":"additional","affiliation":[]},{"given":"L. M.","family":"R\u00edos-Castro","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2022,5,6]]},"container-title":["Discrete Mathematics & Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dmtcs.episciences.org\/9422\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dmtcs.episciences.org\/9422\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:31:15Z","timestamp":1687293075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dmtcs.episciences.org\/6678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,6]]},"references-count":0,"journal-issue":{"issue":"Combinatorics","published-online":{"date-parts":[[2022,5,6]]}},"URL":"https:\/\/doi.org\/10.46298\/dmtcs.6678","relation":{"has-preprint":[{"id-type":"arxiv","id":"2007.15127v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2007.15127v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2007.15127v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2007.15127v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2007.15127","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2007.15127","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,6]]}}}