On the vertex number of almost bipartite hypergraphs

DOI10.1134/S1064562407010085MaRDI QIDQ492430zbMATH OpenOpenAlexFDO

Authors D. A. Shabanov

Publication date 20 August 2015

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064562407010085

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Extremal problems for colourings of uniform hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• On balanced colorings of hypergraphs
• 2-colorings of uniform hypergraphs
• Randomized algorithms for colourings of hypergraphs

Cited in

(5)

• On Some Extremal Properties of Hypergraph Colorings
• Randomized algorithms for colourings of hypergraphs
• An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
• Coloring four-uniform hypergraphs on nine vertices
• Extremal problems for colourings of uniform hypergraphs

This page was built for publication: On the vertex number of almost bipartite hypergraphs

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