First order properties on nowhere dense structures

Journal of Symbolic Logic

Volumn 75, Issue 3, 2010, Pages 868-887

  Nešetřil, Jaroslav ^a   De Mendez, Patrice Ossona ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957366609     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1278682204     Document Type: Article

References (40)

1. M. AJTAI and Y. GUREVICH, Monotone versus positive, Journal of the ACM, vol. 34 (1987), pp. 1004-1015.
2. N. ALECHINA and Y. GUREVICH, Syntax vs. semantics on finite structures. Structures in logic and computer science (J. Mycielski, G. Rozenberg, and A. Salomaa, editors). Lecture Notes in Computer Science, vol. 1261, Springer, 1997, pp. 14-33.
3. A. ATSERIAS, A. DAWAR, and M. GROHE, Preservation under extensions on well-behaved finite structures, 32nd International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 3580, Springer-Verlag, 2005, pp. 1437-1449.
4. A. ATSERIAS, A. DAWAR, and P.G. KOLAITIS, On preservation under homomorphisms and unions of conjunctive queries, Proceedings of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Dystems, ACM Press, 2004, pp. 319-329.
5. On preservation under homomorphisms and unions of conjunctive queries, Journal of the ACM, vol. 53 (2006), pp. 208-237.
6. C. BERGE, Graphes, troisième ed., Gauthier-Villars, Paris, 1983.
7. B. COURCELLE, The monadic second-order logic of graphs I: recognizable sets of finite graphs. Information Computation, vol. 85 (1990), pp. 12-75.
8. A. DAWAR, Finite model theory on tame classes of structures. Mathematical Foundations of Computer Science 2007 (L. Kučera and A. Kučera, editors), Lecture Notes in Computer Science, vol. 4708, Springer, 2007, pp. 2-12.
9. On preservation theorems infinite model theory, July 2007, invited talk at the 6th Panhellenic Logic Symposium -Volos, Greece.
10. A. DAWAR, M. GROHE, and S. KREUTZER, Locally excluding a minor, 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. On forbidden subdivision characterizations of graph classes, European Journal of Combinatorics, vol. 29 (2008), no. 5, pp. 1321-1332.
13. H.-D. EBBINGHAUS and J. FLUM, Finite model theory. Springer-Verlag, 1996.
14. Y. GUREVICH, Toward logic tailored for computational complexity, Computation and proof theory (M. M. Richteret al., editor), Lecture Notes in Mathematics, Springer-Verlag, 1984.
15. P. HELL and J. NEŠETŘIL, Graphs and homomorphisms, Oxford Lecture Series in Mathematics and its Applications, vol. 28, Oxford University Press, 2004.
16. W. HODGES, Model theory, Cambridge University Press, 1993.
17. M. KRODLER and D. SEESE, Monadic NP anagraph minors, Computer Science Logic, Lecture Notes in Computer Science, no. 1584, Springer, 1999, pp. 126-141.
18. L. LIBKIN, Elements of finite model theory, Springer-Verlag, 2004.
19. R.C. LYNDON, Properties preserved under homomorphism, Pacific Journal of Mathematics, vol. 9 (1959), pp. 129-142.
20. e Journées Graphes et Algorithmes (LaBRI -Université Bordeaux I) (L. Esperet, editor), vol. 1372-05, 2005, pp. 55-58.
21. The grad of a graph and classes with bounded expansion, 7th International Colloquium on Graph Theory (André Raspaud and Olivier Delmas, editors), Electronic Notes in Discrete Mathematics, vol. 22, Elsevier, 2005, pp. 101-106.
22. Linear time low tree-width partitions and algorithmic consequences, STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM Press, 2006, pp. 391-400.
23. Low tree-depth partitions of classes with bounded expansion, Midsummer Combinatorial Workshop 2005 and DlMACS, DlMATIA, Rényi Workshop 2005 (Jan Kára, editor), KAM Series, vol. 2006-770, 2006, pp. 76-81.
24. Fraternal augmentations of graphs, coloration and minors, Proceedings of the Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electronic Notes in Discrete Mathematics, vol. 28, 2007, pp. 223-230.
25. Grad and classes with bounded expansion I. Decompositions, European Journal of Combinatorics, vol. 29 (2008), no. 3, pp. 760-776.
26. Grad and classes with bounded expansion II. Algorithmic aspects, European Journal of Combinatorics, vol. 29 (2008), no. 3, pp. 777-791.
27. Grad and classes with bounded expansion III. Restricted graph homomorphism dualities, European Journal of Combinatorics, vol. 29 (2008), no. 4, pp. 1012-1024.
28. On nowhere dense graphs, European Journal of Combinatorics, (2008), submitted.
29. Structural properties of sparse graphs. Building bridges between mathematics and computer science (Martin Grötschel and Gyula O.H. Katona, editors), Bolyai Society Mathematical Studies, vol. 19, Springer, 2008, Edited in honor of L. Lovasz on his 60th birthday.
30. Counting homomorphisms to sparse graphs, European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), vol. 34, Electronic Notes in Discrete Mathematics, no. 1, Elsevier, 2009, pp. 393-397.
31. Counting subgraphs in graphs, in preparation, 2009.
32. From sparse graphs to nowhere dense structures: Decompositions, independence, dualities and limits, Proc. of the fifth European Congress of Mathematics, 2009, submitted.
33. J. NEŠETŘIL, P. OSSONA DE MENDEZ, and D.R. WOOD, Characterizations and examples of graph classes with bounded expansion, European Journal of Combinatorics, (2009), submitted.
34. J. NEŠETŘIL and C. TARDIF, Duality theorems for finite structures (characterizing gaps and good characterizations), Journal of Combinatorial Theory, Series B, vol. 80 (2000), pp. 80-97.
35. Short answers to exponentially long questions: Extremal aspects of homomorphism duality, SIAM Journal of Discrete Mathematics, vol. 19 (2005), no. 4, pp. 914-920.
36. S. PLOTKIN, S. RAO, and W.D. SMITH, Shallow excluded minors and improved graph decomposition, 5th Symp. Discrete Algorithms. SIAM, 1994.
37. B. ROSSMAN, Homomorphism preservation theorems, Journal of the ACM, vol. 55 (2008), no. 3, pp. 1-53.
38. A. STOLBOUSHKIN, Finite monotone properties, Proc. 10th IEEE Symp. on Logic in Computer Science, 1995, pp. 324-330.
39. W. TAIT, A counterexample to a conjecture of Scott and Suppes, The Journal of Symbolic Logic , vol. 24 (1959), pp. 15-16.
40. X. ZHU, Colouring graphs with bounded generalized colouring number, Discrete Mathematics, in press.