When is a random graph projective?

DOI10.1016/J.EJC.2006.06.010MaRDI QIDQ852706zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak, J. Nešetřil

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)

Cites work

• scientific article; zbMATH DE number 3650785 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1775538 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Graph products, Fourier analysis and spectral techniques
• Note on projective graphs
• On colorings of graphs without short cycles
• Paths in graphs
• Strongly rigid relations
• The Shannon capacity of a union

Cited in

(1)

• The smallest hard trees

This page was built for publication: When is a random graph projective?

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