On A Combinatorial Problem of Erdös

DOI10.4153/CMB-1969-107-XMaRDI QIDQ5587081zbMATH OpenWikidataFDO

Authors H. L. Abbott, D. Hanson

Publication date 1969

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1969-107-X

zbMATH Keywords

combinatorics

Cited in

(19)

• The enumeration problem for color critical linear hypergraphs
• On property B and on Steiner systems
• Color-critical graphs and hypergraphs with few edges and no short cycles
• Erdős-Littlewood-Offord problem with arbitrary probabilities
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Colour-critical graphs and hypergraphs
• On the chromatic number of set systems
• On algorithmic methods of analysis of two-colorings of hypergraphs
• The existence problem for colour critical linear hypergraphs
• On a Combinatorial Theorem of Erdös, Ginzburg and Ziv
• Sparse color‐critical graphs and hypergraphs with no short cycles
• scientific article; zbMATH DE number 1735725 (Why is no real title available?)
• On the Horton-Strahler Number for Combinatorial Tries
• On the construction of non-2-colorable uniform hypergraphs
• Improved Bounds for Uniform Hypergraphs without Property B
• Extremal problems in hypergraph colourings
• A combinatorial problem related to Mahler's measure
• On a combinatorical problem of K. Zarankiewicz
• Sparse colour-critical hypergraphs

This page was built for publication: On A Combinatorial Problem of Erdös

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