Triangles in randomly perturbed graphs

DOI10.1017/S0963548322000153MaRDI QIDQ5885187zbMATH OpenWikidataFDO

Authors Julia Böttcher, J. Skokan, O. Parczyk

Publication date 3 April 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2011.07612

zbMATH Keywords

random graphsrandomly perturbed graphstriangle factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Triangles in random graphs
• Random triangles in random graphs
• Triangles in random cubic planar graphs
• On the triangle space of a random graph
• On triangle-free random graphs
• Triangle Factors in Random Graphs
• The number of triangles in random intersection graphs
• scientific article; zbMATH DE number 932188
• Random Triangles in n Dimensions

Cites work

• Adding random edges to dense graphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
• Factors in random graphs
• Hamilton -cycles in randomly perturbed hypergraphs
• High powers of Hamiltonian cycles in randomly augmented graphs
• How many random edges make a dense graph hamiltonian?
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Komlós's tiling theorem via graphon covers
• Matching and covering the vertices of a random graph by copies of a given graph
• On smoothed analysis in dense graphs and formulas
• On the maximal number of independent circuits in a graph
• On the maximal number of independent triangles in graphs
• Optimal threshold for a random graph to be 2-universal
• Powers of Hamiltonian cycles in randomly augmented graphs
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Spanning trees in randomly perturbed graphs
• Sprinkling a few random edges doubles the power
• Stability for vertex cycle covers
• Tilings in randomly perturbed dense graphs
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu

Cited in

(14)

• A triangle process on regular graphs
• On triangles in derangement graphs
• Triangles in random cubic planar graphs
• On the triangle space of a random graph
• Triangle‐factors in pseudorandom graphs
• Factors in randomly perturbed hypergraphs
• 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
• The square of a Hamilton cycle in randomly perturbed graphs
• Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
• How many random edges make an almost-Dirac graph Hamiltonian?
• Fragile minor-monotone parameters under a random edge perturbation
• Rainbow subgraphs of uniformly coloured randomly perturbed graphs

This page was built for publication: Triangles in randomly perturbed graphs

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