A note on 3‐partite graphs without 4‐cycles
From MaRDI portal
Publication:6146771
DOI10.1002/jcd.21742MaRDI QIDQ6146771
Mei Lu, Zequn Lv, Chunqiu Fang
Publication date: 31 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New asymptotics for bipartite Turán numbers
- On the number of edges of quadrilateral-free graphs
- Graphs without four-cycles
- The Zarankiewicz problem in 3‐partite graphs
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
This page was built for publication: A note on 3‐partite graphs without 4‐cycles