Random cyclic triangle-free graphs of prime order

DOI10.1155/2021/5595919zbMath1477.05121OpenAlexW3187835236MaRDI QIDQ2666424

Yanyan Li

Publication date: 22 November 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5595919

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the cover Ramsey number of Berge hypergraphs
• A generalization of generalized Paley graphs and new lower bounds for \(R(3,q)\)
• New lower bounds for seven classical Ramsey numbers \(R(3,q)\)
• A note on the independence number of triangle-free graphs
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• Ádám's conjecture is true in the square-free case
• New bounds on clique-chromatic numbers of Johnson graphs
• The multicolour size-Ramsey number of powers of paths
• A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
• Ramsey Theory
• New Ramsey Bounds from Cyclic Graphs of Prime Order
• Repeated communication and Ramsey graphs
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Dynamic concentration of the triangle-free process
• Accelerating a continuous-time analog SAT solver using GPUs

This page was built for publication: Random cyclic triangle-free graphs of prime order