When is a random graph projective?

DOI10.1016/j.ejc.2006.06.010zbMath1104.05066OpenAlexW4205624872MaRDI QIDQ852706

Jaroslav Nešetřil, Tomasz Łuczak

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.010

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

The smallest hard trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On colorings of graphs without short cycles
• The Shannon capacity of a union
• Graph products, Fourier analysis and spectral techniques
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Strongly rigid relations
• Note on projective graphs
• Paths in graphs