Topological Cliques in Graphs
Authors:
- 1 June 1994
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 3 (2) , 247-256
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 .Keywords
This publication has 5 references indexed in Scilit:
- On the conjecture of hajósCombinatorica, 1981
- Topological cliques of random graphsJournal of Combinatorial Theory, Series B, 1981
- On sets of integers containing k elements in arithmetic progressionActa Arithmetica, 1975
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sindMathematische Nachrichten, 1972
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967