How many F's are there in G?

DOI10.1016/J.EJC.2011.03.007MaRDI QIDQ648970zbMATHOpenAlexFDO

Authors J. Nešetřil, P. Ossona de Mendez

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)

Recommendations

• On nowhere dense graphs
• On the number of types in sparse graphs
• Sparsity. Graphs, structures, and algorithms
• Characterisations of nowhere dense graphs (invited talk)

Cites work

• scientific article; zbMATH DE number 1151379 (Why is no real title available?)
• scientific article; zbMATH DE number 2151253 (Why is no real title available?)
• Counting graph homomorphisms
• Finite Model Theory on Tame Classes of Structures
• First order properties on nowhere dense structures
• From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits
• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Intersection Theorems for Systems of Sets
• Linear time low tree-width partitions and algorithmic consequences
• On nowhere dense graphs
• The Grad of a Graph and Classes with Bounded Expansion
• Tree-depth, subgraph coloring and homomorphism bounds

Cited in

(8)

• Tree densities in sparse graph classes
• On low tree-depth decompositions
• A distributed low tree-depth decomposition algorithm for bounded expansion classes
• A unified approach to structural limits and limits of graphs with bounded tree-depth
• Subgraph densities in a surface
• On nowhere dense graphs
• Characterisations and examples of graph classes with bounded expansion
• How many dead ends in a derangement?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648970)