More on a Problem of Zarankiewicz

DOI10.1007/978-3-642-35261-4_29zbMath1260.05110OpenAlexW18199820MaRDI QIDQ4909543

Chinmoy Dutta

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

minimum number of edgeslarge bipartite graphlarge bipartite independent setsize of bipartite graphssmall bipartite graphs

Mathematics Subject Classification ID

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

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