Large induced forests in sparse graphs

Journal of Graph Theory

Volumn 38, Issue 3, 2001, Pages 113-123

  Alon, Noga ^a   Mubayi, Dhruv ^b   Thomas, Robin ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

D degenerate graph; Induced forests

Indexed keywords

EID: 31244435235     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1028     Document Type: Article

References (8)

1. M. Ajtai, J. Komlós, and E. Szemerédi, A note on Ramsey numbers, J. Combin Theory, Ser. A 29 (1980), 354-360.
2. M. Albertson and R. Haas, A problem raised at the DIMACS Graph Coloring Week, 1998.
3. N. Alon, Induced acyclic subgraphs in sparse bipartite graphs, preprint.
4. N. Alon, J. Kahn, and P. D. Seymour, Large induced degenerate subgraphs in graphs, Graphs Combin 3 (1987), 203-211.
5. B. Bollobás, Chromatic number, girth and maximal degree, Discrete Math 24 (1978), 311-314.
6. A. V. Kostochka and N. P. Mazurova, An inequality in the theory of graph coloring (in Russian), Metody Diskret Analiz 30 (1977), 23-29.
7. J. B. Shearer, A note on the independence number of triangle-free graphs, Discrete Math 46 (1983), 83-87.
8. J. H. van Lint and R. M. Wilson, A course in Combinatorics, Cambridge Univ. Press, Cambridge, UK, 1992, p. 85.