How many F's are there in G?
From MaRDI portal
Publication:648970
DOI10.1016/J.EJC.2011.03.007zbMATH Open1229.05212OpenAlexW1512725763MaRDI QIDQ648970FDOQ648970
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
Recommendations
Cites Work
- Counting graph homomorphisms
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Tree-depth, subgraph coloring and homomorphism bounds
- Intersection Theorems for Systems of Sets
- Title not available (Why is that?)
- On nowhere dense graphs
- Linear time low tree-width partitions and algorithmic consequences
- First order properties on nowhere dense structures
- The Grad of a Graph and Classes with Bounded Expansion
- From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits
- Title not available (Why is that?)
- Finite Model Theory on Tame Classes of Structures
Cited In (8)
- On nowhere dense graphs
- Characterisations and examples of graph classes with bounded expansion
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- Tree densities in sparse graph classes
- Subgraph densities in a surface
- On low tree-depth decompositions
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- 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)