On algorithmic methods of analysis of two-colorings of hypergraphs

DOI10.1007/S10958-016-2711-7MaRDI QIDQ291223zbMATH OpenOpenAlexFDO

Authors A. V. Lebedeva

Publication date 7 June 2016

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-016-2711-7

zbMATH Keywords

hypergraph colorings

Mathematics Subject Classification ID

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

Recommendations

• On balanced colorings of hypergraphs
• Combinatorial extremum problems for 2-colorings of hypergraphs
• On the construction of non-2-colorable uniform hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Extremal problems for colorings of simple hypergraphs and applications

Cites work

• scientific article; zbMATH DE number 2188343 (Why is no real title available?)
• Extremal problems for colourings of uniform hypergraphs
• On A Combinatorial Problem of Erdös
• On a Combinatorial Problem of Erdös and Hajnal
• On a property of families of sets
• On balanced colorings of hypergraphs
• Randomized algorithms for colourings of hypergraphs
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring

Cited in

(6)

• Combinatorial extremum problems for 2-colorings of hypergraphs
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
• On balanced colorings of hypergraphs
• Two-coloring triples such that in each color class every element is missed at least once
• On the construction of non-2-colorable uniform hypergraphs
• On two-colorings of hypergraphs

This page was built for publication: On algorithmic methods of analysis of two-colorings of hypergraphs

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