The Zarankiewicz problem on tripartite graphs

DOI10.1112/JLMS.70621MaRDI QIDQ7302537zbMATH OpenFDO

Authors Francesco Di Braccio, Freddie Illingworth

Publication date 22 July 2026

Published in Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/JLMS.70621

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• A note on vertex list colouring
• Bounded size components -- partitions and transversals.
• Complete subgraphs in a multipartite graph
• Complete Subgraphs of r-partite Graphs
• Eine Extremalaufgabe aus der Graphentheorie.
• Extremal problems for transversals in graphs with bounded degree
• scientific article; zbMATH DE number 4200236 (Why is no real title available?)
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Odd Independent Transversals are Odd
• On a problem of K. Zarankiewicz
• On complete subgraphs of r-chromatic graphs
• On Graphs that do not Contain a Thomsen Graph
• On subgraphs of tripartite graphs
• On the Strong Chromatic Number
• On the structure of linear graphs
• The history of degenerate (bipartite) extremal graph problems
• The linear arboricity of graphs
• Vraagstuk XXVIII.
• Über ein Extremalproblem der Graphentheorie

This page was built for publication: The Zarankiewicz problem on tripartite graphs

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