<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=163170"><dc:title>A note on the 2-colored rectilinear crossing number of random point sets in the unit square</dc:title><dc:creator>Cabello,	Sergio	(Avtor)
	</dc:creator><dc:creator>Czabarka,	Éva	(Avtor)
	</dc:creator><dc:creator>Fabila-Monroy,	Ruy	(Avtor)
	</dc:creator><dc:creator>Higashikawa,	Yuya	(Avtor)
	</dc:creator><dc:creator>Seidel,	Raimund	(Avtor)
	</dc:creator><dc:creator>Székely,	László	(Avtor)
	</dc:creator><dc:creator>Tkadlec,	Josef	(Avtor)
	</dc:creator><dc:creator>Wesolek,	Alexandra	(Avtor)
	</dc:creator><dc:subject>arrangement of points</dc:subject><dc:subject>flat</dc:subject><dc:subject>hyperplane</dc:subject><dc:description>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. 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 ${1 \over 2} - {7 \over 50}$ of the total number of crossings.</dc:description><dc:date>2024</dc:date><dc:date>2024-10-03 09:46:45</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>163170</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
