When is a random graph projective?
type: Item
instance of: scholarly article
title: When is a random graph projective?
zbMATH Open document ID: 1104.05066
published in: European Journal of Combinatorics
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 5072916
author: Tomasz Łuczak
author: J. Nešetřil
MaRDI profile type: Publication
full work available at URL: j.ejc.2006.06.010
OpenAlex ID: W4205624872
cites work: The Shannon capacity of a union
cites work: Graph products, Fourier analysis and spectral techniques
cites work: Paths in graphs
cites work: Q4828516
cites work: Q4519896
cites work: Q4544370
cites work: Note on projective graphs
cites work: On colorings of graphs without short cycles
cites work: Aspects of structural combinatorics. (Graph homomorphisms and their use)
cites work: Strongly rigid relations
cites work: Q3208855
DOI: 10.1016/J.EJC.2006.06.010
description: scientific article; zbMATH DE number 5072916