Turán numbers of several bipartite graphs
From MaRDI portal
Publication:6184156
DOI10.1007/s00373-023-02731-yzbMath1529.05088MaRDI QIDQ6184156
Publication date: 5 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The fractional version of Hedetniemi's conjecture is true
- The early evolution of the \(H\)-free process
- Multicolor Ramsey numbers involving graphs with long suspended paths
- Norm-graphs: Variations and applications
- Chromatic Ramsey numbers
- On generalized Ramsey theory: The bipartite case
- Multicolour Turán problems
- Relatively small counterexamples to Hedetniemi's conjecture
- Norm-graphs and bipartite Turán numbers
- The chromatic Ramsey number of odd wheels
- On the Structure of Edge Graphs
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
- An Upper Bound on Zarankiewicz' Problem
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Hedetniemi's conjecture---a survey
This page was built for publication: Turán numbers of several bipartite graphs