ترغب بنشر مسار تعليمي؟ اضغط هنا

Extending drawings of complete graphs into arrangements of pseudocircles

63   0   0.0 ( 0 )
 نشر من قبل Alan Arroyo
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Motivated by the successful application of geometry to proving the Harary-Hill Conjecture for pseudolinear drawings of $K_n$, we introduce pseudospherical drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit sphere $mathbb{S}^2$ in which the vertices of $G$ are represented as points -- no three on a great circle -- and the edges of $G$ are shortest-arcs in $mathbb{S}^2$ connecting pairs of vertices. Such a drawing has three properties: (1) every edge $e$ is contained in a simple closed curve $gamma_e$ such that the only vertices in $gamma_e$ are the ends of $e$; (2) if $e e f$, then $gamma_ecapgamma_f$ has precisely two crossings; and (3) if $e e f$, then $e$ intersects $gamma_f$ at most once, either in a crossing or an end of $e$. We use Properties (1)--(3) to define a pseudospherical drawing of $G$. Our main result is that, for the complete graph, Properties (1)--(3) are equivalent to the same three properties but with precisely two crossings in (2) replaced by at most two crossings. The proof requires a result in the geometric transversal theory of arrangements of pseudocircles. This is proved using the surprising result that the absence of special arcs ( coherent spirals) in an arrangement of simple closed curves characterizes the fact that any two curves in the arrangement have at most two crossings. Our studies provide the necessary ideas for exhibiting a drawing of $K_{10}$ that has no extension to an arrangement of pseudocircles and a drawing of $K_9$ that does extend to an arrangement of pseudocircles, but no such extension has all pairs of pseudocircles crossing twice.



قيم البحث

اقرأ أيضاً

Hills Conjecture states that the crossing number $text{cr}(K_n)$ of the complete graph $K_n$ in the plane (equivalently, the sphere) is $frac{1}{4}lfloorfrac{n}{2}rfloorlfloorfrac{n-1}{2}rfloorlfloorfrac{n-2}{2}rfloorlfloorfrac{n-3}{2}rfloor=n^4/64 + O(n^3)$. Moon proved that the expected number of crossings in a spherical drawing in which the points are randomly distributed and joined by geodesics is precisely $n^4/64+O(n^3)$, thus matching asymptotically the conjectured value of $text{cr}(K_n)$. Let $text{cr}_P(G)$ denote the crossing number of a graph $G$ in the projective plane. Recently, Elkies proved that the expected number of crossings in a naturally defined random projective plane drawing of $K_n$ is $(n^4/8pi^2)+O(n^3)$. In analogy with the relation of Moons result to Hills conjecture, Elkies asked if $lim_{ntoinfty} text{cr}_P(K_n)/n^4=1/8pi^2$. We construct drawings of $K_n$ in the projective plane that disprove this.
The Harary--Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph $K_n$ is $ H(n) = frac 1 4 leftlfloorfrac{mathstrut n}{mathstrut 2}rightrfloor leftlfloorfrac{mathstrut n-1}{mathstrut 2}rightrfl oor leftlfloorfrac{mathstrut n-2}{mathstrut 2}rightrfloor leftlfloorfrac{mathstrut n-3}{mathstrut 2}right rfloor$. Abrego et al. introduced the notion of shellability of a drawing $D$ of $K_n$. They proved that if $D$ is $s$-shellable for some $sgeqlfloorfrac{n}{2}rfloor$, then $D$ has at least $H(n)$ crossings. This is the first combinatorial condition on a drawing that guarantees at least $H(n)$ crossings. In this work, we generalize the concept of $s$-shellability to bishellability, where the former implies the latter in the sense that every $s$-shellable drawing is, for any $b leq s-2$, also $b$-bishellable. Our main result is that $(lfloor frac{n}{2} rfloor!-!2)$-bishellability of a drawing $D$ of $K_n$ also guarantees, with a simpler proof than for $s$-shellability, that $D$ has at least $H(n)$ crossings. We exhibit a drawing of $K_{11}$ that has $H(11)$ crossings, is 3-bishellable, and is not $s$-shellable for any $sgeq5$. This shows that we have properly extended the class of drawings for which the Harary-Hill Conjecture is proved. Moreover, we provide an infinite family of drawings of $K_n$ that are $(lfloor frac{n}{2} rfloor!-!2)$-bishellable, but not $s$-shellable for any $sgeqlfloorfrac{n}{2}rfloor$.
We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $Oleft(frac{n^{3/2}log{(n/k^3)}}{k^{5/2}} + frac{n}{k} right)$, and the sum of the de grees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is $Oleft(frac{n^{3/2}log{(n/k^3)}}{k^{3/2}} + nright)$. Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal embedded graphs.
Let $ G $ be a simple graph of $ ell $ vertices $ {1, dots, ell } $ with edge set $ E_{G} $. The graphical arrangement $ mathcal{A}_{G} $ consists of hyperplanes $ {x_{i}-x_{j}=0} $, where $ {i, j } in E_{G} $. It is well known that three properties, chordality of $ G $, supersolvability of $ mathcal{A}_{G} $, and freeness of $ mathcal{A}_{G} $ are equivalent. Recently, Richard P. Stanley introduced $ psi $-graphical arrangement $ mathcal{A}_{G, psi} $ as a generalization of graphical arrangements. Lili Mu and Stanley characterized the supersolvability of the $ psi $-graphical arrangements and conjectured that the freeness and the supersolvability of $ psi $-graphical arrangements are equivalent. In this paper, we will prove the conjecture.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا