Triangle Factors in Random Graphs
From MaRDI portal
Publication:4354592
DOI10.1017/S0963548397003106zbMath0886.05101OpenAlexW2164680149MaRDI QIDQ4354592
Publication date: 4 May 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548397003106
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (34)
Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Dirac-type theorems in random hypergraphs ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ The threshold bias of the clique-factor game ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Covering cycles in sparse graphs ⋮ Decomposing tournaments into paths ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Finding large rainbow trees in colourings of \(K_{n, n}\) ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Graph and hypergraph packing ⋮ Minimalist designs ⋮ How tight is the corner relaxation? Insights gained from the stable set problem ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs ⋮ Edge-decompositions of graphs with high minimum degree ⋮ A proof of Ringel's conjecture ⋮ \(H(n)\)-factors in random graphs ⋮ Finding tight Hamilton cycles in random hypergraphs faster ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Triangle‐factors in pseudorandom graphs ⋮ An asymptotic bound for the strong chromatic number ⋮ Increasing the flexibility of the herding attack ⋮ Sprinkling a Few Random Edges Doubles the Power ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
This page was built for publication: Triangle Factors in Random Graphs
