A note on 3‐partite graphs without 4‐cycles

DOI10.1002/JCD.21742MaRDI QIDQ6146771zbMATH OpenFDO

Authors Zequn Lv, Mei Lu, Chunqiu Fang

Publication date 31 January 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

zbMATH Keywords

extremal number4-cycle3-partite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Density of balanced 3-partite graphs without 3-cycles or 4-cycles
• Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
• Graphs without four-cycles
• Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
• The number of 4-cycles in a graph

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 89768 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3031694 (Why is no real title available?)
• Graphs without four-cycles
• New asymptotics for bipartite Turán numbers
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• On the number of edges of quadrilateral-free graphs
• The Zarankiewicz problem in 3-partite graphs

This page was built for publication: A note on 3‐partite graphs without 4‐cycles

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