A set S of 2n+1 points in the plane is said to be in general position if no three points of S are collinear and no four are concyclic. A circle is called halving with respect to S if it has three points of S on its circumference, n-1 points in its interior, and n-1 in its exterior. We prove the following surprising result: any set of 2n+1 points in general position in the plane has exactly n^2 halving circles.
We prove the first $χ$-bounding function for circle graphs that is optimal up to a constant factor. To be more precise, we prove that every circle graph with clique number at most $ω$ has chromatic number at most $2ω\log_2 (ω) +2ω\log_2(\log_2 (ω)) + 10ω$.
The number of s-separated k-sets in various circles
这篇文章研究了选择排列在大小为$n_1,\ldots,n_p$的$p$圆中的$k$对象的方法的数量，使得没有两个选择的对象之间具有小于$s$对象。如果所有$1\leq i \leq p$的$n_i\geq sk+1$，则此编号显示为$\frac{n_1+\ldots+n_p}{k}\binom{n_1+\ldots+n_p-sk-1}{k-1}$。给出了这一结论的一个组合证明，并导出了一些很好的组合公式。
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic theory, we formalize the notion of a gyrocoloring of a graph: the vertices are colored by translates of a single Borel set in the circle group, and neighbouring vertices receive disjoint translates. The corresponding gyrochromatic number of a graph always lies between the fractional chromatic number and the circular chromatic number. We investigate basic propert…
An arrangement of circles in which circles intersect only in angles of $π/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is planar. The same result holds for arrangement of circles that intersect in an angle of at most $π/2$. For the general case we prove that the maximal number of edges in an intersection graph of an arrangement of orthogonal circles lies in between $4n - O\left(\sqrt{n}\right)$ and $\left(4+\frac{5}{11}\right)n$, for $n$ being the number of circles. Based on the …
A thrackle is a graph drawing in which every pair of edges meets exactly once. The Thrackle Conjecture (established by John Conway) states that the number of edges of a thrackle cannot exceed the number of its vertices. Cairns, Koussas, and Nikolayevsky (2015) prove that the Thrackle Conjecture holds for great-circle thrackles drawn on the sphere. They also posit that the Thrackle Conjecture can be restated to say that a graph can be drawn as a thrackle drawing in the plane if and only if it admits a great-circle thrackle drawing. We demonstrate that the class of great-circle thrackleable grap…
Because the problem of Apollonius is generally considered over the reals, it suffers from variance of number: there are at most eight circles simultaneously tangent to a given trio of circles, but some configurations have fewer than eight tangent circles. This issue arises over other non-closed fields as well. Using the tools of enriched enumerative geometry, we give two different ways to count the circles of Apollonius such that invariance of number holds over any field of characteristic not 2. We also pose the geometricity problem for local indices in enriched enumerative geometry.
A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply that treewidth and Hadwiger number are linearly tied on the class of circle graphs, and that the unavoidable induced subgraphs of a vertex-minor-closed class with large treewidth are the usual suspects if and only if the class has bounded rank-width. Using the same tools, we also study the treewidth of graphs $G$ that have a circular drawing whose crossing gra…
