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