SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 24, Issue 2, 2004, Pages 287-304

Induced subdivisions in Ks,s-free graphs of large average degree

(2) Kühn, Daniela a Osthus, Deryk b

a FREIE UNIVERSITÄT BERLIN (Germany)

b HUMBOLDT UNIVERSITY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042715234 PISSN: 02099683 EISSN: None Source Type: Journal
DOI: 10.1007/s00493-004-0017-8 Document Type: Article

Times cited : (79)

References (19)

1
- 85025517191
- A dense infinite Sidon sequence
- M. AJTAI, J. KOMLÓS and E. SZEMERÉDI: A dense infinite Sidon sequence, Europ. J. Comb. 2 (1981), 1-11.
- (1981) Europ. J. Comb. , vol.2 , pp. 1-11
- Ajtai, M.¹ Komlós, J.² Szemerédi, E.³

2
- 0003151866
- Coloring graphs with sparse neighbourhoods
- N. ALON, M. KRIVELEVICH and B. SUDAKOV: Coloring graphs with sparse neighbourhoods, J. Combin. Theory B 77 (1999), 73-82.
- (1999) J. Combin. Theory B , vol.77 , pp. 73-82
- Alon, N.¹ Krivelevich, M.² Sudakov, B.³

3
- 0003430191
- Wiley-Interscience
- N. ALON and J. SPENCER; The Probabilistic Method (2nd edition), Wiley-Interscience 2000.
- (2000) The Probabilistic Method (2nd Edition)
- Alon, N.¹ Spencer, J.²

4
- 0003904891
- Springer-Verlag
- B. BOLLOBÁS: Graph Theory, Graduate Texts in Mathematics 63, Springer-Verlag 1979.
- (1979) Graph Theory, Graduate Texts in Mathematics , vol.63
- Bollobás, B.¹

5
- 0041622337
- Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs
- B. BOLLOBÁS and A. THOMASON: Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs, Europ. J. Comb. 19 (1998), 883-887.
- (1998) Europ. J. Comb. , vol.19 , pp. 883-887
- Bollobás, B.¹ Thomason, A.²

6
- 0003677229
- Graduate Texts in Mathematics, Springer-Verlag
- R. DIESTEL: Graph Theory, Graduate Texts in Mathematics 173, Springer-Verlag 1997.
- (1997) Graph Theory , vol.173
- Diestel, R.¹

7
- 1842805359
- On Ramsey covering-numbers
- North Holland/American Elsevier, New York
- A. GYÁRFÁS: On Ramsey covering-numbers, Coll. Math. Soc. János Bolyai, in: Infinite and Finite Sets, North Holland/American Elsevier, New York 1975.
- (1975) Coll. Math. Soc. János Bolyai, in: Infinite and Finite Sets
- Gyárfás, A.¹

8
- 0003444842
- preprint
- R. HÄGGKVIST and A. SCOTT: Arithmetic progressions of cycles, preprint.
- Arithmetic Progressions of Cycles
- Häggkvist, R.¹ Scott, A.²

9
- 0012877434
- Asymptotic choice number for triangle free graphs
- A. R. JOHANSSON: Asymptotic choice number for triangle free graphs, DIMACS technical report 91-5.
- DIMACS Technical Report , vol.91 , Issue.5
- Johansson, A.R.¹

10
- 84987477084
- Radius two trees specify χ-bounded classes
- H. A. KIERSTEAD and S. G. PENRICE: Radius two trees specify χx-bounded classes, J. Graph Theory 18 (1994), 119-129.
- (1994) J. Graph Theory , vol.18 , pp. 119-129
- Kierstead, H.A.¹ Penrice, S.G.²

11
- 0030547416
- Topological cliques in graphs II
- J. KOMLÓS and E. SZEMERÉDI: Topological cliques in graphs II, Combin. Probab. Comput. 5 (1996), 79-90.
- (1996) Combin. Probab. Comput. , vol.5 , pp. 79-90
- Komlós, J.¹ Szemerédi, E.²

12
- 24844460143
- PhD thesis, Universität Hamburg
- D. KÜHN: Cycles, Minors and Trees, PhD thesis, Universität Hamburg 2001.
- (2001) Cycles, Minors and Trees
- Kühn, D.¹

13
- 3042714125
- Large topological cliques in graphs without a 4-cycIe
- D. KÜHN and D. OSTHUS: Large topological cliques in graphs without a 4-cycIe, Combin. Probab. Computing 13 (2004), 93-102.
- (2004) Combin. Probab. Computing , vol.13 , pp. 93-102
- Kühn, D.¹ Osthus, D.²

14
- 85068306235
- s,s-free graphs
- to appear
- s,s-free graphs, Combinatorica, to appear.
- Combinatorica
- Kühn, D.¹ Osthus, D.²

15
- 0041184333
- Dense graphs without 3-regular subgraphs
- L. PYBER, V. RÖDL and E. SZEMERÉDI: Dense graphs without 3-regular subgraphs, J. Combin. Theory B 63 (1995), 41-54.
- (1995) J. Combin. Theory B , vol.63 , pp. 41-54
- Pyber, L.¹ Rödl, V.² Szemerédi, E.³

16
- 0031495423
- Induced trees in graphs of large chromatic number
- A. SCOTT: Induced trees in graphs of large chromatic number, J. Graph Theory 24 (1997), 297-311.
- (1997) J. Graph Theory , vol.24 , pp. 297-311
- Scott, A.¹

17
- 0038957263
- Subtrees of a graph and chromatic number
- G. Chartrand (ed.), John Wiley, New York
- D. P. SUMNER: Subtrees of a graph and chromatic number, in: The Theory and Applications of Graphs, G. Chartrand (ed.), John Wiley, New York 1981.
- (1981) The Theory and Applications of Graphs
- Sumner, D.P.¹

18
- 84986446926
- Subdivisions of graphs with large minimum degree
- C. THOMASSEN: Subdivisions of graphs with large minimum degree, J. Graph Theory 8 (1984), 23-28.
- (1984) J. Graph Theory , vol.8 , pp. 23-28
- Thomassen, C.¹

19
- 0034413815
- On arithmetic progressions of cycle lengths in graphs
- J. VERSTRAËTE: On arithmetic progressions of cycle lengths in graphs, Combin. Probab. Comput. 9 (2000), 369-373.
- (2000) Combin. Probab. Comput. , vol.9 , pp. 369-373
- Verstraëte, J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.