Triangles in randomly perturbed graphs
From MaRDI portal
Publication:5885187
DOI10.1017/S0963548322000153WikidataQ122782038 ScholiaQ122782038MaRDI QIDQ5885187
Jozef Skokan, Julia Böttcher, Unnamed Author, Olaf Parczyk
Publication date: 3 April 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.07612
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Hamiltonicity of graphs perturbed by a random regular graph ⋮ Hamiltonicity of graphs perturbed by a random geometric graph ⋮ A Ramsey–Turán theory for tilings in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximal number of independent triangles in graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
- Stability for vertex cycle covers
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- On smoothed analysis in dense graphs and formulas
- Factors in random graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- Adding random edges to dense graphs
- How many random edges make a dense graph hamiltonian?
- Sprinkling a Few Random Edges Doubles the Power
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- Powers of Hamiltonian cycles in randomly augmented graphs
- Spanning trees in randomly perturbed graphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Tilings in Randomly Perturbed Dense Graphs
- Optimal threshold for a random graph to be 2-universal
- Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
- Komlós's tiling theorem via graphon covers
- On the maximal number of independent circuits in a graph
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
- High powers of Hamiltonian cycles in randomly augmented graphs
This page was built for publication: Triangles in randomly perturbed graphs
