Sparse combinatorial structures: classification and applications

MaRDI QIDQ3096706zbMATH OpenFDO

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

Publication date 11 November 2011

Full work available at URL http://ebooks.worldscinet.com/ISBN/9789814324359/9789814324359_0156.html

zbMATH Keywords

bounded expansioncomplexitygraphshomomorphismhypergraphsmodel checkingproperty testingseparatorssparsitystructural combinatoricsstructures

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Descriptive complexity and finite models (68Q19) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits
• Sparsity. Graphs, structures, and algorithms
• Structural sparsity
• Counting homomorphisms to sparse graphs
• Extremal problems for sparse graphs

Cited in

(10)

• Modeling limits in hereditary classes: reduction and application to trees
• Structural sparsity
• Counting homomorphisms to sparse graphs
• Extremal problems for sparse graphs
• From sparse graphs to nowhere dense structures: decompositions, independence, dualities and limits
• Structural Properties of Sparse Graphs
• A unified approach to structural limits and limits of graphs with bounded tree-depth
• Existence of modeling limits for sequences of sparse structures
• On first-order transductions of classes of graphs
• First-order limits, an analytical perspective

This page was built for publication: Sparse combinatorial structures: classification and applications

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