Density of balanced 3-partite graphs without 3-cycles or 4-cycles

DOI10.37236/10958zbMath1506.05075OpenAlexW4313292816MaRDI QIDQ2112583

Chunqiu Fang, Mei Lu, Zequn Lv

Publication date: 11 January 2023

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

Full work available at URL: https://doi.org/10.37236/10958

zbMATH Keywords

balanced 3-partite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items

Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán numbers of bipartite graphs plus an odd cycle
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Edges in graphs with large girth
• General properties of some families of graphs defined by systems of equations
• The Difference Between Consecutive Primes, II
• Extremal graphs without three‐cycles or 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 a problem of K. Zarankiewicz