On nowhere dense graphs

European Journal of Combinatorics

Volumn 32, Issue 4, 2011, Pages 600-617

  Nesetřil, Jaroslav ^a   Ossona de Mendez, Patrice ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79951556527     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2011.01.006     Document Type: Article

References (40)

1. Alon N., McDiarmid C., Reed B. Star arboricity. Combinatorica 1992, 12:375-380.
2. Alon N., Spencer J.H. The Probabilistic Method 2008, John Wiley & Sons.
3. Atserias A., Dawar A., Grohe M. Preservation under extensions on well-behaved finite structures. Lecture Notes in Computer Science 2005, vol. 3580:1437-1449. Springer-Verlag.
4. Atserias A., Dawar A., Kolaitis P.G. On preservation under homomorphisms and unions of conjunctive queries. Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems 2004, 319-329. ACM Press.
5. Atserias A., Dawar A., Kolaitis P.G. On preservation under homomorphisms and unions of conjunctive queries. J. ACM 2006, 53:208-237.
6. Bollobás B., Thomason A. Proof of a conjecture of Mader, Erdos and Hajnal on topological complete subgraphs. European J. Combin. 1998, 19:883-887.
7. Chung F.R.K., Graham R.L., Wilson R.M. Quasi-random graphs. Combinatorica 1989, 9(4):345-362.
8. Courcelle B. The monadic second-order logic of graphs I: recognizable sets of finite graphs. Inform. and Comput. 1990, 85:12-75.
9. Dawar A. Finite model theory on tame classes of structures. Lecture Notes in Computer Science 2007, vol. 4708:2-12. Springer. L. Kučera, A. Kučera (Eds.).
10. A. Dawar, M. Grohe, S. Kreutzer, Locally excluding a minor, in: Proc. 22nd IEEE Symp. on Logic in Computer Science, 2007.
11. Z. Dvořák, Asymptotical structure of combinatorial objects, Ph.D.Thesis, Charles University, Faculty of Mathematics and Physics, 2007.
12. Dvořák Z. On forbidden subdivision characterizations of graph classes. European J. Combin. 2008, 29(5):1321-1332.
13. Erdos P. Some remarks on the theory of graphs. Bull. Amer. Math. Soc. 1947, 53:292-294.
14. Erdos P. Graph theory and probability. Canad. J. Math. 1959, 11(1):34-38.
15. Erdos P., Hajnal A. On topological complete subgraphs of certain graphs. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae 1969, 7:193-199.
16. Grünbaum B. Acyclic colorings of planar graphs. Israel J. Math. 1973, 14:390-408.
17. Komlós J., Szemerédi E. Topological cliques in graphs. Combin. Probab. Comput. 1994, 3:247-256.
18. Komlós J., Szemerédi E. Topological cliques in graphs II. Combin. Probab. Comput. 1996, 5:79-90.
19. Kostochka A.V. On the minimum of the Hadwiger number for graphs with given average degree. Metody Diskret. Anal. 1982, 38:37-58. (in Russian) English translation: AMS Translations (2), 132 (1986), 15-32.
20. Kreidler M., Seese D. Monadic NP and graph minors. Lecture Notes in Computer Science 1999, vol. 1584:126-141. Springer.
21. Kierstead H.A., Yang D. Orderings on graphs and game coloring number. Order 2003, 20:255-264.
22. Mader W. Hinreichende bedingungen fur die existenz von teilgraphen die zu einem vollstaandingen graphen homoomorph sind. Math. Nachr. 1972, 53:145-150.
23. Nesetřil J., Ossona de Mendez P. Colorings and homomorphisms of minor closed classes. Algorithms and Combinatorics 2003, vol. 25:651-664. Discrete & Computational Geometry. B. Aronov, S. Basu, J. Pach, M. Sharir (Eds.).
24. Nesetřil J., Ossona de Mendez P. Linear time low tree-width partitions and algorithmic consequences. STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing 2006, 391-400. ACM Press.
25. Nesetřil J., Ossona de Mendez P. Tree depth, subgraph coloring and homomorphism bounds. European J. Combin. 2006, 27(6):1022-1041.
26. Nesetřil J., Ossona de Mendez P. Grad and classes with bounded expansion I. Decompositions. European J. Combin. 2008, 29(3):760-776.
27. Nesetřil J., Ossona de Mendez P. Grad and classes with bounded expansion II. Algorithmic aspects. European J. Combin. 2008, 29(3):777-791.
28. Nesetřil J., Ossona de Mendez P. Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. European J. Combin. 2008, 29(4):1012-1024.
29. Nesetřil J., Ossona de Mendez P. Fraternal augmentations, arrangeability and linearly bounded Ramsey numbers. European J. Combin. 2009, 30(7):1696-1703.
30. Nesetřil J., Ossona de Mendez P. First order properties on nowhere dense structures. J. Symbolic Logic 2010, 75(3):868-887.
31. J. Nesetřil, P. Ossona de Mendez, How many F's are there in G?, European J. Combin. (2011) (submitted for publication).
32. Nesetřil J., Shelah S. Order of countable graphs. European J. Combin. 2003, 24:649-663.
33. Nesetřil J., Tardif C. Duality theorems for finite structures (characterizing gaps and good characterizations). J. Combin. Theory Ser. B 2000, 80:80-97.
34. Plotkin S., Rao S., Smith W.D. Shallow excluded minors and improved graph decomposition. 5th Symp. Discrete Algorithms 1994, 462-470. SIAM.
35. Rossman B. Homomorphism preservation theorems. J. ACM 2008, 55(3):1-53.
36. Schaffer P. Optimal node ranking of trees in linear time. Inform. Process. Lett. 1989/90, 33:91-96.
37. Spencer J. Ramsey's theorem-a new lower bound. J. Combin. Theory Ser. A 1975, 18(1):108-115.
38. Tao T. The dichotomy between structure and randomness, arithmetic progression, and the primes. Proceedings of the Intersnational Congress of Mathematicians, Madrid 2006 2007, vol. 1:581-608. European Math. Society.
39. Thomason A. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 1984, 95:261-265.
40. Zhu X. Colouring graphs with bounded generalized colouring number. Discrete Math. 2009, 309(18):5562-5568.