Triangle Factors in Random Graphs

DOI10.1017/S0963548397003106zbMATH Open0886.05101OpenAlexW2164680149MaRDI QIDQ4354592FDOQ4354592

Authors: Michael Krivelevich 

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

Recommendations

• Random triangles in random graphs
• Threshold Functions for H-factors
• Factors in random graphs

zbMATH Keywords

thresholdrandom graphperfect matchingtriangle factor

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (46)

• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
• Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
• Combinatorial and computational aspects of graph packing and graph decomposition
• Dirac-type theorems in random hypergraphs
• Covering cycles in sparse graphs
• Clique-factors in graphs with sublinear -independence number
• Cycle factors and renewal theory
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Threshold Functions for H-factors
• The hitting time of clique factors
• Edge-decompositions of graphs with high minimum degree
• Transference for loose Hamilton cycles in random 3-uniform hypergraphs
• Edge-decompositions of graphs with high minimum degree
• Triangle packing and covering in dense random graphs
• Embedding clique-factors in graphs with low \(\ell\)-independence number
• How tight is the corner relaxation? Insights gained from the stable set problem
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• A robust Corrádi-Hajnal theorem
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
• Triangle‐factors in pseudorandom graphs
• An asymptotic bound for the strong chromatic number
• Minimum degree conditions for tight Hamilton cycles
• On oriented cycles in randomly perturbed digraphs
• The threshold bias of the clique-factor game
• Graph and hypergraph packing
• Triangles in randomly perturbed graphs
• Nonvertex-balanced factors in random graphs
• Increasing the flexibility of the herding attack
• Hamilton cycles in sparse robustly expanding digraphs
• Random triangles in random graphs
• Minimalist designs
• Sprinkling a few random edges doubles the power
• \(H(n)\)-factors in random graphs
• A proof of the Erdős-Faber-Lovász conjecture
• Spanning subdivisions in dense digraphs
• Finding tight Hamilton cycles in random hypergraphs faster
• Corrádi and Hajnal's theorem for sparse random graphs
• All feedback arc sets of a random Turán tournament have \(\lfloor{n}/{k}\rfloor-{k}+1\) disjoint \({k}\)-cliques (and this is tight)
• On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem
• Dirac-type results for tilings and coverings in ordered graphs
• Near-perfect clique-factors in sparse pseudorandom graphs
• Factors in random graphs
• A proof of Ringel's conjecture
• Finding large rainbow trees in colourings of \(K_{n, n}\)
• Decomposing tournaments into paths

This page was built for publication: Triangle Factors in Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354592)