How many \(F\)'s are there in \(G\)?
type: Item
instance of: scholarly article
title: How many \(F\)'s are there in \(G\)?
zbMATH Open document ID: 1229.05212
author: J. Nešetřil
author: P. Ossona de Mendez
published in: European Journal of Combinatorics
publication date: 2011-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 5982460
zbMATH Keywords: trichotomy theorem
zbMATH Keywords: somewhere dense-nowhere dense classification
MaRDI profile type: Publication
full work available at URL: j.ejc.2011.03.007
OpenAlex ID: W1512725763
cites work: Q3424888
cites work: Finite Model Theory on Tame Classes of Structures
cites work: Intersection Theorems for Systems of Sets
cites work: Q4660723
cites work: Q4389332
cites work: The Grad of a Graph and Classes with Bounded Expansion
cites work: Linear time low tree-width partitions and algorithmic consequences
cites work: Tree-depth, subgraph coloring and homomorphism bounds
cites work: Grad and classes with bounded expansion. I: Decompositions
cites work: Grad and classes with bounded expansion. II: Algorithmic aspects
cites work: First order properties on nowhere dense structures
cites work: Q3567810
cites work: On nowhere dense graphs
DOI: 10.1016/J.EJC.2011.03.007
description: scientific article; zbMATH DE number 5982460