Searcharxiv⌕ Search

arXiv subjects

Jan Hladký

Publications and source records attributed to Jan Hladký.

At least 19 recordsLinked to original sources

The tree packing conjecture for trees of almost linear maximum degree

We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any trees such that $T_i$ has $i$ vertices and maximum degree at most $cn/\log n$, then $\{T_1,\dots,T_n\}$ packs into $K_n$. Our main result actually allows to replace the host graph $K_n$ by an arbitrary quasirandom graph, and to generalize from trees to graphs of bounded degeneracy that are rich in bare paths, contain some odd degree vertices, and only satisfy much less stringent restrictions on their number of vertices.

math.CO↗

Arithmetic progressions in a random set on a budget

A restricted-budget version of the random graph process, introduced by Frieze, Krivelevich, and Michaeli in 2025, studies the construction of structures by an online player who can purchase only a limited number of random edges. In this paper, we transfer this framework from random graphs to random subsets of integers, focusing on the construction of $k$-term arithmetic progressions. A player, Builder, is presented with a sequence of $t$ integers drawn uniformly at random from $[n]$. As the elements are revealed one by one, Builder must immediately and irrevocably decide whether to select the current integer, subject to a maximum budget of $b$ selected elements in total. We establish the optimal thresholds for this process, proving that for $t = ω(n^{1-2/k})$, a budget of $b = Θ((n/t)^{\frac{k-2}{2}})$ is both necessary and sufficient for Builder to successfully construct a $k$-term arithmetic progression with high probability.

math.CO↗

Connectivity of inhomogeneous random graphs II

Each graphon $W:Ω^2\rightarrow[0,1]$ yields an inhomogeneous random graph model $G(n,W)$. We show that $G(n,W)$ is asymptotically almost surely connected if and only if (i) $W$ is a connected graphon and (ii) the measure of elements of $Ω$ of $W$-degree less than $α$ is $o(α)$ as $α\rightarrow 0$. These two conditions encapsulate the absence of several linear-sized components, and of isolated vertices, respectively. We study in bigger detail the limit probability of the property that $G(n,W)$ contains an isolated vertex, and, more generally, the limit distribution of the minimum degree of $G(n,W)$.

math.CO↗

Hamiltonicity of inhomogeneous random graphs

We provide a complete characterization of those graphons $W$ for which the inhomogeneous random graph $G(n,W)$ is asymptotically almost surely Hamiltonian. The characterization involves three conditions. Two of them constitute the characterization of $G(n,W)$ being a.a.s. connected, as was shown recently by Hladký and Viswanathan. The third condition captures a geometric obstacle which prevents $G(n,W)$ from having perfect fractional matchings.

math.CO↗

Digraphons: connectivity and spectral aspects

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of sequences of directed graphs (digraphs). Our results address their decomposition into strongly connected components, periodicity, spectral properties, and asymptotic behaviour of their large powers.

math.CO↗

Inhomogeneous random 2-SAT

We introduce an inhomogeneous variant of random 2-SAT. Each variable $v_1,\ldots,v_n$ is assigned a type from a state space $Λ$, independently at random. Clause inclusion is governed by a symmetric measurable kernel $W$ on $(Λ\times \{+,-\})^2$, in analogy with the inhomogeneous random graph model of Bollobás, Janson, and Riordan: given literals $\ell_i\in\{v_i,\neg v_i\}$ and $\ell_j\in\{v_j,\neg v_j\}$, the clause $\{\ell_i,\ell_j\}$ appears with probability $W(\mathrm{type}(\ell_i),\mathrm{type}(\ell_j))/(2n)$. In particular, for a variable $v_i$ of type $x\inΛ$, the slices $W((+,x),\cdot)$ and $W((-,x),\cdot)$ describe how $v_i$ and $\neg v_i$ interact with other literals. We identify a parameter $ρ^*(W)$, defined as the spectral radius of an integral operator derived from $W$, and show that $ρ^*(W)<1$ and $ρ^*(W)>1$ correspond to asymptotically almost surely satisfiable and unsatisfiable instances, respectively. The satisfiability threshold for homogeneous random 2-SAT is well-established, occurring when the ratio of clauses to variables is $1$. This corresponds to a weight function of $W \equiv 1$ and a clause density of $1/(2n)$. Our result extends this classical result to a broad class of models controlled by types of variables.

math.CO↗

Graphon branching processes and fractional isomorphism

In their study of the giant component in inhomogeneous random graphs, Bollobás, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded graphon. We prove that the tree structures underlying two such branching processes have the same distributions if and only if the corresponding graphons are fractionally isomorphic, a notion introduced by Grebík and Rocha. A different class of branching processes was introduced by Hladký, Nachmias, and Tran in relation to uniform spanning trees in finite graphs approximating a given connected graphon. We prove that that the tree structures of two such branching processes have the same distributions if and only if the corresponding graphons are fractionally isomorphic up to scalar multiple. Combined with a recent result of Archer and Shalev, this implies that if uniform spanning trees of two dense graphs have a similar local structure, they have a similar scaling limit. As a side result we give a characterization of fractional isomorphism for graphs as well as graphons in terms of their connected components.

math.CO↗

Random minimum spanning tree and dense graph limits

A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph $K_n$ whose edges get independent weights from the distribution $UNIFORM[0,1]$ converges to Apéry's constant in probability, as $n\to\infty$. We generalize this result to sequences of graphs $G_n$ that converge to a graphon $W$. Further, we allow the weights of the edges to be drawn from different distributions (subject to moderate conditions). The limiting total weight $κ(W)$ of the minimum spanning tree is expressed in terms of a certain branching process defined on $W$, which was studied previously by Bollobás, Janson and Riordan in connection with the giant component in inhomogeneous random graphs.

math.CO↗

From flip processes to dynamical systems on graphons

We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labeled $k$-vertex graphs into itself ($k$ is fixed). The process starts with a given $n$-vertex graph $G_0$. In each step, the graph $G_i$ is obtained by sampling $k$ random vertices $v_1,\ldots,v_k$ of $G_{i-1}$ and replacing the induced graph $F:=G_{i-1}[v_1,\ldots,v_k]$ by $\mathcal{R}(F)$. This class contains several previously studied processes including the Erdős--Rényi random graph process and the triangle removal process. Actually, our definition of flip processes is more general, in that $\mathcal{R}(F)$ is a probability distribution on $\mathcal{H}_k$, thus allowing randomised replacements. Given a flip process with a rule $\mathcal{R}$, we construct time-indexed trajectories $Φ:\mathcal{W}_0\times [0,\infty)\rightarrow\mathcal{W}_0$ in the space of graphons. We prove that for any $T > 0$ starting with a large finite graph $G_0$ which is close to a graphon $W_0$ in the cut norm, with high probability the flip process will stay in a thin sausage around the trajectory $(Φ(W_0,t))_{t=0}^T$ (after rescaling the time by the square of the order of the graph). These graphon trajectories are then studied from the perspective of dynamical systems. Among others topics, we study continuity properties of these trajectories with respect to time and initial graphon, existence and stability of fixed points and speed of convergence (whenever the infinite time limit exists). We give an example of a flip process with a periodic trajectory.

math.CO↗

On cospectral graphons

In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectra, by equality of cycle densities, and by a unitary transformation. We also give an example of two cospectral graphons that cannot be approximated by two sequences of cospectral graphs in the cut distance.

math.CO↗

A tower lower bound for the degree relaxation of the Regularity Lemma

It is well-known that if $(A,B)$ is an $\tfrac{\varepsilon}{2}$-regular pair (in the sense of Szemerédi) then there exist sets $A'\subset A$ and $B'\subset B'$ with $|A'|\leq \varepsilon|A|$ and $|B'|\leq \varepsilon|B|$ so that the degrees of all vertices in $A\setminus A'$ differ by at most $\varepsilon|B|$ and the degrees of all vertices in $B\setminus B'$ differ by at most $\varepsilon|A|$. We call such a property "$\varepsilon$-degularity". This leads to the notion of an "$\varepsilon$-degular" partition of a graph in the same way as the definition of $\varepsilon$-regular pairs leads to the notion of $\varepsilon$-regular partitions. We show that there exist graphs in which any $\varepsilon$-degular partition requires the number of clusters to be $\mathrm{tower}(Θ(\varepsilon^{-1/3}))$. That is, even though degularity is a substantial relaxation of regularity, in general one cannot improve much on the bounds that come with Szemerédi's regularity lemma.

math.CO↗

On pattern-avoiding permutons

The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutation of order $k$ have a particularly simple structure. Namely, almost every fiber of the disintegration of the permuton (say, along the x-axis) consists only of atoms, at most $(k-1)$ many, and this bound is sharp. We use this to give a simple proof of the `permutation removal lemma'.

math.CO↗

Limits of Latin squares

We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the cut distance, and a space of limit objects - so-called Latinons. Key results of our theory are the compactness of the limit space and the equivalence of the topologies induced by the cut distance and the left-convergence. Last, using Keevash's recent results on combinatorial designs, we prove that each Latinon can be approximated by a finite Latin square.

math.CO↗

Approximating fractionally isomorphic graphons

Grebík and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be approximated in the cut distance by fractionally isomorphic finite graphs. This answers the main question from ibid. As an easy but convenient corollary, we deduce that every regular graphon can be approximated by regular graphs.

math.CO↗

Prominent examples of flip processes

Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule which is just a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labelled graphs of a fixed order $k$ into itself. The process starts with an arbitrary given $n$-vertex graph $G_0$. In each step, the graph $G_i$ is obtained by sampling $k$ random vertices $v_1,\ldots,v_k$ of $G_{i-1}$ and replacing the induced graph $G_{i-1}[v_1,\ldots,v_k]$ by $\mathcal{R}(G_{i-1}[v_1,\ldots,v_k])$. Using the formalism of dynamical systems on graphons associated to each such flip process from ibid. we study several specific flip processes, including the triangle removal flip process and its generalizations, 'extremist flip processes' (in which $\mathcal{R}(H)$ is either a clique or an independent set, depending on whether $e(H)$ has less or more than half of all potential edges), and 'ignorant flip processes' in which the output $\mathcal{R}(H)$ does not depend on $H$.

math.CO↗

Packing degenerate graphs

Given $D$ and $γ>0$, whenever $c>0$ is sufficiently small and $n$ sufficiently large, if $\mathcal{G}$ is a family of $D$-degenerate graphs of individual orders at most $n$, maximum degrees at most $\tfrac{cn}{\log n}$, and total number of edges at most $(1-γ)\binom{n}{2}$, then $\mathcal{G}$ packs into the complete graph $K_{n}$. Our proof proceeds by analysing a natural random greedy packing algorithm. This version of the manuscript corrects a small error that appeared in the published version [Adv Math, 354 (2019), 106739].

math.CO↗

Cut distance identifying graphon parameters over weak* limits

The theory of graphons comes with the so-called cut norm and the derived cut distance. The cut norm is finer than the weak* topology (when considering the predual of $L^{1}$-functions). Doležal and Hladký [J. Combin. Theory Ser. B 137 (2019), 232-263] showed, that given a sequence of graphons, a cut distance accumulation graphon can be pinpointed in the set of weak* accumulation points as a minimizer of the entropy. Motivated by this, we study graphon parameters with the property that their minimizers or maximizers identify cut distance accumulation points over the set of weak* accumulation points. We call such parameters cut distance identifying. Of particular importance are cut distance identifying parameters coming from homomorphism densities, $t(H,\cdot)$. This concept is closely related to the emerging field of graph norms, and the notions of the step Sidorenko property and the step forcing property introduced by Kráľ, Martins, Pach and Wrochna [J. Combin. Theory Ser. A 162 (2019), 34-54]. We prove that a connected graph is weakly norming if and only if it is step Sidorenko, and that if a graph is norming then it is step forcing. Further, we study convexity properties of cut distance identifying graphon parameters, and find a way to identify cut distance limits using spectra of graphons. We also show that continuous cut distance identifying graphon parameters have the «pumping property», and thus can be used in the proof of the Frieze-Kannan regularity lemma.

math.CO↗

Relating the cut distance and the weak* topology for graphons

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence $W_1,W_2,W_3,\ldots$ of graphons converges in the cut distance if and only if we have equality of the sets of weak* accumulation points and of weak* limit points of all sequences of graphons $W_1',W_2',W_3',\ldots$ that are weakly isomorphic to $W_1,W_2,W_3,\ldots$. We further give a short descriptive set theoretic argument that each sequence of graphons contains a subsequence with the property above. This in particular provides an alternative proof of the theorem of Lovász and Szegedy about compactness of the space of graphons. We connect these results to "multiway cut" characterization of cut distance convergence from [Ann. of Math. (2) 176 (2012), no. 1, 151-219]. These results are more naturally phrased in the Vietoris hyperspace $K$ over graphons with the weak* topology. We show that graphons with the cut distance topology are homeomorphic to a closed subset of $K$, and deduce several consequences of this fact. From these concepts a new order on the space of graphons emerges. This order allows to compare how structured two graphons are. We establish basic properties of this "structurdness order".

math.CO↗