Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1501.03808

A Probabilistic Approach to Problems on Distance Graphs and Graphs of Diameters (Candidate-Degree Dissertation Author's Review, in Russian)

Andrei A. Kokotkin
View original source ↗Read source document ↗Export metadata ↓

Abstract

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced subgraph with chromatic number at most 4 that covers at least 91.7 percent of the vertices of the whole graph. The results of the second and third parts are related to the standard model of a random graph with n labeled vertices in which the edges occur independently with probability p, where p is a function of n. This is known as the Erdos--Renyi model G(n,p). Given a monotone property of a graph, Erdos and Renyi's theorem (1960) states that there exists a critical threshold value of p(n) below which the probability that a random graph has that property tends to one (as n tends to infinity) and above which the probability tends to zero. The main results of the second part are concerned with the (monotone) property of a graph to be isomorphic to some unit-distance graph in Euclidean d-space with fixed dimension d. The results of this part guarantee that for d in {2, 3, 4, 5, 6, 7, 8}, the threshold value of p(n) is big-Theta of 1/n. Furthermore, the case d = 1 stands apart from the case of higher dimensions; here the threshold probability is big-Theta of 1/(n^(4/3)). The results of the third part are devoted to studying "graphs of diameters" from the probabilistic standpoint. In particular, it is shown that under some conditions, almost all graphs of diameters in the plane have chromatic number less than 3. More generally, it is shown for G(n,p) that graphs of diameters have a tendency to chromatic degeneration (for large n) when p is close to 0, but have a tendency to completeness when p is close to 1.

Explore related subjects

math.COmath.MGmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrei A. Kokotkin. 2014-12-29. A Probabilistic Approach to Problems on Distance Graphs and Graphs of Diameters (Candidate-Degree Dissertation Author's Review, in Russian). https://arxiv.org/abs/1501.03808

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

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗
arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗
arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗