How many \(F\)'s are there in \(G\)?

DOI10.1016/j.ejc.2011.03.007zbMath1229.05212OpenAlexW1512725763MaRDI QIDQ648970

Patrice Ossona de Mendez, Jaroslav Nešetřil

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.03.007

zbMATH Keywords

somewhere dense-nowhere dense classificationtrichotomy theorem

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ On low tree-depth decompositions ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ On nowhere dense graphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes

Cites Work

• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• On nowhere dense graphs
• Tree-depth, subgraph coloring and homomorphism bounds
• Linear time low tree-width partitions and algorithmic consequences
• Intersection Theorems for Systems of Sets
• The Grad of a Graph and Classes with Bounded Expansion
• Finite Model Theory on Tame Classes of Structures
• First order properties on nowhere dense structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How many \(F\)'s are there in \(G\)?