scientific article

zbMath1152.05002MaRDI QIDQ3539854

Jaroslav Nešetřil, Ji{ří} Matoušek

Publication date: 19 November 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsdiscrete mathematicsgenerating functionsgraph theoryplanar graphstreespartially ordered setsprobabilistic methodproblem solvingRamsey theoremCayley theoremreal projective planeTuran theoremgeometric interpretationfinite projective planesSperner's theoremcounting techniquesCauchy Schwartz inequality

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items (17)

The local limit of the uniform spanning tree on dense graphs ⋮ The \(\mathbb{Z}_2\)-genus of Kuratowski minors ⋮ Concentration of maximum degree in random planar graphs ⋮ Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity ⋮ On Betti numbers of flag complexes with forbidden induced subgraphs ⋮ Unnamed Item ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ On unified framework for continuous-time grey models: an integral matching perspective ⋮ Approximate Dynamic Programming based on High Dimensional Model Representation ⋮ Computational aspects of ordered integer partitions with bounds ⋮ Unnamed Item ⋮ Partitioning graphs into induced subgraphs ⋮ Local linear set on graphs with bounded twin cover number ⋮ Expected Maximum Block Size in Critical Random Graphs ⋮ An isoperimetric inequality for Hamming balls and local expansion in hypercubes ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: