Rainbow cliques in randomly perturbed dense graphs

DOI10.1007/978-3-030-83823-2_25MaRDI QIDQ6604688

Shoham Letzter, Dan Hefetz, Oran Danon, Elad Aigner-Horev

Publication date: 13 September 2024

zbMATH Keywords

random graphsanti-Ramseyrandomly perturbed graphs

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an anti-Ramsey threshold for random graphs
• Ramsey properties of random graphs
• Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
• An algorithmic framework for obtaining lower bounds for random Ramsey problems
• Anti-Ramsey threshold of cycles for sparse graphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• On smoothed analysis in dense graphs and formulas
• Rainbow subgraphs in properly edge‐colored graphs
• Random graphs with monochromatic triangles in every edge coloring
• On an anti‐Ramsey threshold for sparse graphs with one triangle
• How many random edges make a dense graph hamiltonian?
• Threshold Functions for Ramsey Properties
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Universality for bounded degree spanning trees in randomly perturbed graphs
• Tilings in Randomly Perturbed Dense Graphs
• Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs

This page was built for publication: Rainbow cliques in randomly perturbed dense graphs