Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs

DOI10.37236/10068zbMath1471.05044arXiv2012.06327OpenAlexW3200068549MaRDI QIDQ2049617

Linyuan Lu, Shuliang Bai

Publication date: 27 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.06327

zbMATH Keywords

extremal set theoryhypergraph Turán problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Turán problems on non-uniform hypergraphs
• An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
• Vertex coverings by monochromatic cycles and trees
• On the Turán density of \(\{1, 3\}\)-hypergraphs
• Non-uniform Turán-type problems
• On the structure of linear graphs
• Acyclic coloring of graphs
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On the structure of linear graphs