Topological cliques in graphs 2
@article{Komls1996TopologicalCI,
title={Topological cliques in graphs 2},
author={J. Koml{\'o}s and E. Szemer{\'e}di},
journal={Comb. Probab. Comput.},
year={1996},
volume={5},
pages={79-90}
}This note contains a refinement of our paper [8], leading to an alternative proof of a conjecture of Mader and of Erdős and Hajnal recently proved by Bollobas and Thomason.
Topics from this paper
57 Citations
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
- Computer Science, Mathematics
- Eur. J. Comb.
- 1998
- 112
- PDF
Immersion of transitive tournaments in digraphs with large minimum outdegree
- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2019
- 2
- PDF
Extremal Digraph Results for Topological Complete Subgraphs
- Computer Science, Mathematics
- Eur. J. Comb.
- 1998
- 5
Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree
- Mathematics, Computer Science
- Comb.
- 2004
- 51
Density theorems for bipartite graphs and related Ramsey-type results
- Mathematics, Computer Science
- Comb.
- 2009
- 89
- Highly Influenced
- PDF
Proof of Komlós's conjecture on Hamiltonian subsets
- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2017
- 3
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 12 REFERENCES
Topological cliques in graphs. Combinatorics, Probability & Computing
- 1994
Topological complete subgraphs in random graphs
- Studia . Sci . Math . Hung .
- 1979
Topological complete subgraphs in random graphs. Studia
- Sci. Math. Hung
- 1979