A geometric theory of hypergraph colouring

DOI10.1007/BF01840474zbMath0768.05026OpenAlexW2063382580MaRDI QIDQ1188297

Geoffrey P. Whittle

Publication date: 13 August 1992

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137442

zbMATH Keywords

polymatroidhypergraph colouring

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Universal Tutte polynomial ⋮ Generalized Dehn-Sommerville relations for hypergraphs ⋮ Recognizing Polymatroids Associated with Hypergraphs ⋮ A 2-isomorphism theorem for hypergraphs ⋮ Unnamed Item ⋮ Critical problem for a \(q\)-analogue of polymatroids ⋮ The Hodge structure of the coloring complex of a hypergraph ⋮ Arrangements, channel assignments, and associated polynomials ⋮ Some excluded-minor theorems for a class of polymatroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dowling group geometries and the critical problem
• Modular elements of geometric lattices
• A class of geometric lattices based on finite groups
• An Affine Representation for Transversal Geometries
• Rado's theorem for polymatroids
• Semimodular Functions and Combinatorial Geometries
• THE CRITICAL PROBLEM FOR POLYMATROIDS
• On the algebraic theory of graph colorings

This page was built for publication: A geometric theory of hypergraph colouring