How many F's are there in G?

European Journal of Combinatorics

Volumn 32, Issue 7, 2011, Pages 1126-1141

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b ÉCOLE DES HAUTES ÉTUDES EN SCIENCES SOCIALES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. Borgs C., Chayes J., Lovász L., Sós V.T., Vesztergombi K. Counting graph homomorphisms. Algorithms and Combinatorics 2006, vol. 26:315-371. Springer-Verlag. M. Klazar, J. Kratochvíl, M. Loebl, J. Matoušek, R. Thomas, P. Valtr (Eds.).
2. 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.).
3. Z. Dvořák, D. Krá, R. Thomas, Finding subgraphs and testing FOL properties in sparse graphs, Tech. Report, KAM Series, 2009.
4. G. Elek, G. Lippner, An analogue of the Szemeredi regularity lemma for bounded degree graphs, ArXiv, e-prints, 2008.
5. ErdO{double acute}s P. On sequences of integers no one of which divides the product of two others and on some related problems. Tomskogo Gosudarstvennogo Universiteta Ucen Zapiski 1938, 2:74-82.
6. ErdO{double acute}s P., Rado R. Intersection theorems for systems of sets. Journal of the London Mathematical Society 1960, 35:85-90.
7. Hell P., Nešetřil J. Counting list homomorphisms for graphs with bounded degrees. DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 2004, vol. 63:105-112. American Mathematical Society (AMS), (in English). J. Nešetřil (Ed.).
8. Matoušek J., Nešetřil J. Invitation to Discrete Mathematics 1998, Oxford University Press, second printing 2008.
9. J. Nešetřil, P. Ossona de Mendez, Aspects algorithmiques des classes d'expansion bornée, 7e Journées Graphes et Algorithmes (L. Esperet, ed.), vol. 1372-05, LaBRI-Université Bordeaux I, 2005, pp. 55-58.
10. Nešetřil J., Ossona de Mendez P. The grad of a graph and classes with bounded expansion. Electronic Notes in Discrete Mathematics 2005, vol. 22:101-106. Elsevier. A. Raspaud, O. Delmas (Eds.).
11. Nešetř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.
12. Nešetřil J., Ossona de Mendez P. Low tree-depth partitions of classes with bounded expansion. KAM Series 2006, vol. 2006-770:76-81. J. Kára (Ed.).
13. Nešetřil J., Ossona de Mendez P. Tree depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics 2006, 27(6):1022-1041.
14. Nešetřil J., Ossona de Mendez P. Grad and classes with bounded expansion I. Decompositions. European Journal of Combinatorics 2008, 29(3):760-776.
15. Nešetřil J., Ossona de Mendez P. Grad and classes with bounded expansion II. Algorithmic aspects. European Journal of Combinatorics 2008, 29(3):777-791.
16. Nešetřil J., Ossona de Mendez P. First order properties on nowhere dense structures. The Journal of Symbolic Logic 2010, 75(3):868-887.
17. Nešetřil J., Ossona de Mendez P. From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits. European Congress of Mathematics 2010, 135-165. European Mathematical Society.
18. Nešetřil J., Ossona de Mendez P. On nowhere dense graphs. European Journal of Combinatorics 2011, 32(4):600-617.