Blocking set free configurations and their relations to digraphs and hypergraphs

DOI10.1016/S0012-365X(96)00183-5zbMath0891.05016OpenAlexW2017151232WikidataQ127063910 ScholiaQ127063910MaRDI QIDQ1356757

Harald Gropp

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00183-5

zbMATH Keywords

blocking set free configurations

Mathematics Subject Classification ID

Hypergraphs (05C65) Other designs, configurations (05B30) Other finite incidence structures (geometric aspects) (51E30)

Related Items

Configurations and graphs. II, Colouring problems for symmetric configurations with block size 3, Counting symmetric configurations \(v_3\), Square critically 3-chromatic hypergraphs

Cites Work

• Configurations and graphs
• Signsolvability revisited
• List-colourings of graphs
• Every 7-regular digraph contains an even cycle
• Enumeration of regular graphs 100 years ago
• Weakly associative lattices and projective planes
• On combinatorial papers of König and Steinitz
• Nonsymmetric configurations with natural index
• Configurations and graphs. II
• Every 8-uniform 8-regular hypergraph is 2-colorable
• Are These Figures Oxymora?
• The Even Cycle Problem for Directed Graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item