Combinatorial extremum problems for 2-colorings of hypergraphs
From MaRDI portal
Publication:2435805
DOI10.1134/S0001434611090264zbMath1282.05076MaRDI QIDQ2435805
Publication date: 20 February 2014
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434611090264
05C35: Extremal problems in graph theory
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
Related Items
New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), 2-colorings of hypergraphs with large girth, On some generalizations of the property B problem of an \(n\)-uniform hypergraph
Cites Work