More on a problem of Zarankiewicz

DOI10.1007/978-3-642-35261-4_29MaRDI QIDQ4909543zbMATH OpenOpenAlexFDO

Authors Chinmoy Dutta, Jaikumar Radhakrishnan

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_29

zbMATH Keywords

large bipartite graphlarge bipartite independent setminimum number of edgessize of bipartite graphssmall bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1256780
• A geometric construction of a superconcentrator of depth 2
• Maximum number of edges of a bipartite graph without complete bipartite subgraphs
• New results on the Zarankiewicz problem
• 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">)<

Cited in

(2)

• scientific article; zbMATH DE number 3267421 (Why is no real title available?)
• scientific article; zbMATH DE number 3311770 (Why is no real title available?)

This page was built for publication: More on a problem of Zarankiewicz

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