Large topological cliques in graphs without a 4-cycle

Combinatorics Probability and Computing

Volumn 13, Issue 1, 2004, Pages 93-102

  Kühn, Daniela ^a   Osthus, Deryk ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GRAPH THEORY; THEOREM PROVING; TOPOLOGY;

BIPARTITE GRAPHS; LOGARITHMIC TERMS;

COMBINATORIAL MATHEMATICS;

EID: 3042714125     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005650     Document Type: Article

References (20)

1. Alon, N., Rónyai, L. and Szabó, T. (1999) Norm-graphs: Variations and applications. J. Combin. Theory Ser. B 76 280-290.
2. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
3. Bollobás, B. (1979) Graph Theory, Vol. 63 of Graduate Texts in Mathematics, Springer.
4. Bollobás, B. and Thomason, A. (1998) Proof of a conjecture of Mader, Erdos and Hajnal on topological complete subgraphs. Europ. Journal Combin. 19 883-887.
5. Chung, F. and Graham, R. (1998) Erdos on Graphs: His Legacy of Unsolved Probles, A K Peters.
6. Diestel, R. (1997) Graph Theory, Vol. 173 of Graduate Texts in Mathematics, Springer.
7. 6-free bipartite graphs and product representation of squares. Discrete Math. 165/166 371-375.
8. Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience.
9. Jung, H. A. (1970) Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen. Math. Ann. 187 95-103.
10. Kollár, J., Rónyai, L. and Szabó, T. (1996) Norm graphs and bipartite Turán numbers. Combinatorica 16 399-406.
11. Komlós, J. and Szemerédi, E. (1994) Topological cliques in graphs. Combin. Probab. Comput. 3 247-256.
12. Komlós, J. and Szemerédi, E. (1996) Topological cliques in graphs II. Combin. Probab. Comput. 5 79-90.
13. Kühn, D. and Osthus, D. (2002) Topological minors in graphs of large girth. J. Combin. Theory Ser. B 86 364-380.
14. r+2 in graphs of average degree at least r + ε and large but constant girth. Submitted.
15. Kühn, D. and Osthus, D. (2003) Minors in graphs of large girth. Random Struct. Alg. 22 213-225.
16. s,s-free graphs. Submitted.
17. Kühn, D. and Osthus, D. 4-cycles in graphs without a forbidden even cycle. Submitted.
18. Mader, W. (1998) Topological subgraphs in graphs of large girth. Combinatorica 18 405-412.
19. -. J. Graph Theory 30 261-276.
20. Mader, W. (2001) Subdivisions of a graph of maximal degree n + 1 in graphs of average degree n + ε and large girth. Combinatorica 21 251-265.