Topological cliques of random graphs

DOI10.1016/0095-8956(81)90066-6MaRDI QIDQ599826zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Advances in graph theory
• Cliques in random graphs
• Hajos' graph-coloring conjecture: Variations and counterexamples
• On Representatives of Subsets
• On the conjecture of Hajos

Cited in

(9)

• Topological cliques in graphs II
• Crux, space constraints and subdivisions (extended abstract)
• Coloring immersion-free graphs
• Topological Cliques in Graphs
• Crux, space constraints and subdivisions
• Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
• Trees in random graphs
• Minors, connectivity, and diameter in randomly perturbed sparse graphs
• List-coloring graphs without subdivisions and without immersions

This page was built for publication: Topological cliques of random graphs

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