Indexed metadata
Topological Cliques in Graphs
János komlós, Endre Szemerédi
Source record
Source: Crossref
Published: Jun 1, 1994
DOI: 10.1017/s0963548300001140
Open original source ↗Source abstract
Let f ( t ) be the largest integer such that every graph with average degree t has a topological clique with f ( i ) vertices. It is widely believed that . Here we prove the weaker estimate .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.