Combinatorial extremum problems for 2-colorings of hypergraphs

DOI10.1134/S0001434611090264zbMath1282.05076OpenAlexW1987218176MaRDI QIDQ2435805

A. P. Rozovskaya

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

zbMATH Keywords

2-coloringasymptotic lower bound\(n\)-uniform hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ 2-colorings of hypergraphs with large girth ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy colorings of uniform hypergraphs
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: Combinatorial extremum problems for 2-colorings of hypergraphs