Extremal K_(s,t)-free bipartite graphs

zbMATH Open1196.05041MaRDI QIDQ3575429FDOQ3575429

Authors: C. Balbuena, P. García-Vázquez, Xavier Marcote, J. Carlos Valenzuela-Tripodoro 

Publication date: 27 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/735/0.html

Recommendations

• 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">)<
• Maximum number of edges of a bipartite graph without complete bipartite subgraphs
• New results on the Zarankiewicz problem
• scientific article; zbMATH DE number 2197878
• The Zarankiewicz problem in 3-partite graphs

zbMATH Keywords

extremal graph theoryZarankiewicz problemforbidden subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (9)

• New results on the Zarankiewicz problem
• Making a \(K_4\)-free graph bipartite
• Bipartite independence number in graphs with bounded maximum degree
• Title not available (Why is that?)
• The structure and the number of \(P_7\)-free bipartite graphs
• The Zarankiewicz problem in 3-partite graphs
• Maximum number of edges of a bipartite graph without complete bipartite subgraphs
• Extremal bipartite independence number and balanced coloring
• 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

This page was built for publication: Extremal \(K_{(s,t)}\)-free bipartite graphs

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