When is a random graph projective?

DOI10.1016/J.EJC.2006.06.010zbMATH Open1104.05066OpenAlexW4205624872MaRDI QIDQ852706FDOQ852706

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

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

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)