THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K4) AND THE (q + 2)-POINT LINE AS MINORS

DOI10.1093/qmath/39.2.223zbMath0656.05022OpenAlexW1997733622MaRDI QIDQ3803130

Joseph P. S. Kung

Publication date: 1988

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/39.2.223

zbMATH Keywords

critical exponentgrowth ratenumber of edgesminor-closed classlong-line graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (6)

The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics ⋮ Cliques in dense GF(\(q\))-representable matroids ⋮ Disjoint cocircuits in matroids with large rank ⋮ Combinatorial geometries representable over GF(3) and GF(q). I: The number of points ⋮ The Erdös-Pósa property for matroid circuits ⋮ A characterization of certain excluded-minor classes of matroids

This page was built for publication: THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K₄) AND THE (q + 2)-POINT LINE AS MINORS