Extremal problems for sparse graphs

MaRDI QIDQ3078211zbMATH OpenFDO

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

Publication date 18 February 2011

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Sparse combinatorial structures: classification and applications
• Sparsity. Graphs, structures, and algorithms
• Structural Properties of Sparse Graphs
• On ultralimits of sparse graph classes
• Structural sparsity

Cited in

(7)

• Structural sparsity
• Counting homomorphisms to sparse graphs
• On ultralimits of sparse graph classes
• Sparse combinatorial structures: classification and applications
• Structural Properties of Sparse Graphs
• A unified approach to structural limits and limits of graphs with bounded tree-depth
• On low tree-depth decompositions

This page was built for publication: Extremal problems for sparse graphs

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