Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1210.6905

Theory on Structure and Coloring of Maximal Planar Graphs (I): Relationship between Structure and Coloring

Jin Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Maximal planar graph refers to the planar graph with the most edges, which means no more edges can be added so that the resulting graph is still planar. The Four-Color Conjecture says that every planar graph without loops is 4-colorable. Indeed, in order to prove Four-Color Conjecture, it clearly suffices to show that all maximal planar graphs are 4-colorable. Since this conjecture was proposed in 1852, no mathematical proofs have been invented up until now. Maybe the main reasons lie in the following three aspects in terms of maximal planar graphs: not clearing up the structures, not figuring out the coloring types, and not straightening out the relation between structure and coloring. For this, we will write a series of articles to study the structure and coloring theory of maximal planar graphs systematically. This is our first article, which focuses mainly on the structure and coloring relations. First, we introduce a new way to construct maximal planar graphs. The advantage of this method is that it establishes an immediate relation with 4-colorings, and reveals how a given maximal planar graph is generated. Second, a special class of maximal planar graphs--recursive maximal planar graphs is researched in depth, which lays a foundation for solving the uniquely 4-colorable planar graphs conjecture(see subsequent articles). Third, we discover an important mode for classifying 4-colorings: tree-coloring and cycle-coloring, which runs through the whole series of articles. Furthermore, this mode is applied to the research on an arbitrary 4-coloring and its corresponding structure of unions of two and three bicolored subgraphs. Finally, we introduce the concepts of black-white coloring and stamen phenomenon, and find out a necessary and sufficient condition for an even cycle to be a 2-colorable cycle.

Explore related subjects

math.GMmath.CO

Keep this discovery

BibTeXRIS

Jin Xu. 2012-10-16. Theory on Structure and Coloring of Maximal Planar Graphs (I): Relationship between Structure and Coloring. https://arxiv.org/abs/1210.6905

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗