Minors, Embeddability, and Extremal Problems for Hypergraphs

DOI10.1007/978-1-4614-0110-0_31zbMATH Open1272.05142OpenAlexW2273609295MaRDI QIDQ2847928

Uli Wagner

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_31

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph minors (05C83)

Related Items (5)

Graph minors. XIV: Extending an embedding ⋮ A minmax relationship between embeddable and rigid graphs ⋮ Coloring hypergraphs with excluded minors ⋮ On constructing the minimal realizations of hypergraphs ⋮ -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY

This page was built for publication: Minors, Embeddability, and Extremal Problems for Hypergraphs

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