On subgraphs of tripartite graphs
From MaRDI portal
Abstract: Bollob'{a}s, ErdH{o}s, and Szemer'{e}di [Discrete Math 13 (1975), 97--107] investigated a tripartite generalization of the Zarankiewicz problem: what minimum degree forces a tripartite graph with vertices in each part to contain an octahedral graph ? They proved that suffices and suggested it could be weakened to for some constant . In this note we show that their method only gives and provide many constructions that show if true, is better possible.
Recommendations
Cites work
- Complete subgraphs in a multipartite graph
- Extremal problems for transversals in graphs with bounded degree
- scientific article; zbMATH DE number 3041944 (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 extremal problems of graphs and generalized graphs
- On Graphs that do not Contain a Thomsen Graph
- Über ein Problem von K. Zarankiewicz
Cited in
(5)
This page was built for publication: On subgraphs of tripartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2092375)