S. Cabello, É Czabarka, R. Fabila-Monroy, Y. Higashikawa, R. Seidel, L. Székely, J. Tkadlec, A. Wesolek
{"title":"A note on the 2-colored rectilinear crossing number of random point sets in the unit square","authors":"S. Cabello, É Czabarka, R. Fabila-Monroy, Y. Higashikawa, R. Seidel, L. Székely, J. Tkadlec, A. Wesolek","doi":"10.1007/s10474-024-01436-9","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span>\\(S\\)</span> be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of <span>\\(S\\)</span> with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the probability that <span>\\(S\\)</span> defines a pair of crossing edges of the same color is equal to <span>\\(1/4\\)</span>. This is connected to a recent result of Aichholzer et al. [1] who showed that by 2-colouring the edges of a geometric graph and counting monochromatic crossings instead of crossings, the number of crossings can be more than halved. \nOur result shows that for the described random drawings, there is a coloring of the edges such that the number of monochromatic crossings is in expectation <span>\\(\\frac{1}{2}-\\frac{7}{50}\\)</span> of the total number of crossings.</p></div>","PeriodicalId":50894,"journal":{"name":"Acta Mathematica Hungarica","volume":"173 1","pages":"214 - 226"},"PeriodicalIF":0.6000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10474-024-01436-9.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematica Hungarica","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10474-024-01436-9","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let \(S\) be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of \(S\) with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the probability that \(S\) defines a pair of crossing edges of the same color is equal to \(1/4\). This is connected to a recent result of Aichholzer et al. [1] who showed that by 2-colouring the edges of a geometric graph and counting monochromatic crossings instead of crossings, the number of crossings can be more than halved.
Our result shows that for the described random drawings, there is a coloring of the edges such that the number of monochromatic crossings is in expectation \(\frac{1}{2}-\frac{7}{50}\) of the total number of crossings.
期刊介绍:
Acta Mathematica Hungarica is devoted to publishing research articles of top quality in all areas of pure and applied mathematics as well as in theoretical computer science. The journal is published yearly in three volumes (two issues per volume, in total 6 issues) in both print and electronic formats. Acta Mathematica Hungarica (formerly Acta Mathematica Academiae Scientiarum Hungaricae) was founded in 1950 by the Hungarian Academy of Sciences.