Topological cliques of random graphs

DOI10.1016/0095-8956(81)90066-6zbMath0415.05031OpenAlexW2068014664MaRDI QIDQ599826

Béla Bollobás, Paul A. Catlin

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90066-6

zbMATH Keywords

random graphstopological cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Coloring immersion-free graphs, Topological Cliques in Graphs, Topological cliques in graphs II, Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz, The order of the largest complete minor in a random graph, Trees in random graphs, Unnamed Item

Cites Work

• Unnamed Item
• Advances in graph theory
• Hajos' graph-coloring conjecture: Variations and counterexamples
• On the conjecture of Hajos
• Cliques in random graphs
• On Representatives of Subsets