Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries

DOI10.2307/2000042zbMath0596.05019OpenAlexW4252068746MaRDI QIDQ3728012

Joseph P. S. Kung

Publication date: 1986

Full work available at URL: https://doi.org/10.2307/2000042

zbMATH Keywords

bond graphcritical exponentsgrowth ratematroidsminor-closed classes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial geometries and geometric closure systems (51D20)

Related Items (4)

Excluding Kuratowski graphs and their duals from binary matroids ⋮ Binary Supersolvable Matroids and Modular Constructions ⋮ The Möbius matroids ⋮ The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flows and generalized coloring theorems in graphs
• Decomposition of regular matroids
• Topology of series-parallel networks
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• Some Homeomorphism Properties of Graphs
• Matroids and Graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On the chromatic number of binary matroids
• Modular Constructions for Combinatorial Geometries
• Non-Separable and Planar Graphs
• Transversals and matroid partition
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries

This page was built for publication: Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries