Blocking set free configurations and their relations to digraphs and hypergraphs

DOI10.1016/S0012-365X(96)00183-5zbMATH Open0891.05016OpenAlexW2017151232WikidataQ127063910 ScholiaQ127063910MaRDI QIDQ1356757FDOQ1356757

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

Recommendations

• On combinatorial papers of König and Steinitz
• Configurations and graphs. II
• scientific article; zbMATH DE number 24833

zbMATH Keywords

blocking set free configurations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Counting symmetric configurations \(v_3\)
• Title not available (Why is that?)
• Square critically 3-chromatic hypergraphs
• Colouring problems for symmetric configurations with block size 3
• Configurations and graphs. II

This page was built for publication: Blocking set free configurations and their relations to digraphs and hypergraphs

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