(0, 1)-matrices with no half-half submatrix of ones

DOI10.1006/eujc.1996.0133zbMath0887.05037OpenAlexW2041071418MaRDI QIDQ1372611

J. Ning

Publication date: 14 December 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0133

zbMATH Keywords

matrixzeroes

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

New results on the Zarankiewicz problem ⋮ Extremal bipartite independence number and balanced coloring ⋮ Contributions to the problem of Zrankiewicz ⋮ A connection between coding theory and polarized partition relations ⋮ 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 ⋮ Bipartite Independence Number in Graphs with Bounded Maximum Degree

This page was built for publication: (0, 1)-matrices with no half-half submatrix of ones