scientific article; zbMATH DE number 2197878
From MaRDI portal
Publication:5466019
Recommendations
- Maximum number of edges of a bipartite graph without complete bipartite subgraphs
- Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)<
- scientific article; zbMATH DE number 4103103
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Extremal \(K_{(s,t)}\)-free bipartite graphs
Cited in
(15)- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- New asymptotics for bipartite Turán numbers
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t,t}\)
- On the non-(p-1)-partite K_p-free graphs
- Infinite Turán problems for bipartite graphs
- Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>-free bipartite graphs
- Extremal \(K_{(s,t)}\)-free bipartite graphs
- Maximum number of edges of a bipartite graph without complete bipartite subgraphs
- scientific article; zbMATH DE number 4059441 (Why is no real title available?)
- Pagenumber of complete bipartite graphs
- scientific article; zbMATH DE number 4103103 (Why is no real title available?)
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Complete bipartite graphs without small rainbow stars
- The edge-density for \(K_{2,t}\) minors
- Forbidden subgraphs in the norm graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466019)
