The order of the largest complete minor in a random graph

N. Fountoulakis; D. Kühn; D. Osthus

Home/Archive/arXiv

arXiv · 0705.0325

The order of the largest complete minor in a random graph

N. Fountoulakis·D. Kühn·D. Osthus

View original source ↗Read source document ↗Export metadata ↓

Abstract

Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge probability p. Bollobas, Catlin and Erdos asymptotically determined ccl(G (n,p)) when p is a constant. Luczak, Pittel and Wierman gave bounds on ccl(G(n,p)) when p is very close to 1/n, i.e. inside the phase transition. Extending the results of Bollobas, Catlin and Erdos, we determine ccl(G(n,p)) quite tightly, for p>C/n where C is a large constant. If p=C/n, for an arbitrary constant C>1, then we show that asymptotically almost surely ccl(G (n,p)) is of order square-root of n. This answers a question of Krivelevich and Sudakov.

Explore related subjects

math.CO math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

N. Fountoulakis, D. Kühn, D. Osthus. 2007-05-02. The order of the largest complete minor in a random graph. https://arxiv.org/abs/0705.0325

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

arXiv2026

A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice

In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Turán graph. Using this bijection, we then compute asymptotically the average value of some statistics on those meet-irreducible compositions.

math.CO↗

arXiv2026

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$

Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduced $[k]$-Roman domination framework unifies classical Roman, double, triple, and higher-strength protection schemes by allowing each fortified vertex to provide up to $k$ levels of support. In this paper, we investigate the $[k]$-Roman domination number $γ_{[k]R}(G)$ on cylindrical grids $C_m \Box P_n$. We relate $[k]$-Roman domination to efficient domination and establish exact values for regular graphs admitting an efficient dominating set; as a consequence, we obtain explicit values for broad families of toroidal grids and determine exactly when the cylindrical graphs $C_m\Box P_n$ admit an efficient dominating set. Building on these structural insights, we derive several upper bounds for $γ_{[k]R}(C_m \Box P_n)$ for small fixed values of $m$, accompanied by explicit labeling patterns that attain these bounds. All obtained bounds are systematically compared, revealing parameter ranges in which different constructions dominate depending on the value of $k$ and the length of the path. In addition, we present exact packing numbers for selected cylindrical graphs, which complement the domination results and enable further refinements via local weight reductions. Our results extend and unify known domination-type parameters on grid-like structures and highlight new regularities that emerge as the reinforcement strength increases.

math.CO↗