On one combinatorial problem of Erdös

zbMATH Open1282.05208MaRDI QIDQ886591FDOQ886591

Authors: D. A. Shabanov 

Publication date: 27 June 2007

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Cited In (6)

• 2-colorings of hypergraphs with large girth
• Extremal problems in hypergraph colourings
• On balanced colorings of hypergraphs
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

This page was built for publication: On one combinatorial problem of Erdös

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