A problem in rearrangements of (0,1)-matrices

DOI10.1016/0012-365X(80)90226-5zbMath0468.05017MaRDI QIDQ1156137

Ron Aharoni

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

rearrangement(0,1)-matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (7)

Some extremal problems concerning the square of a (0,1)-matrix ⋮ Noise sensitivity in continuum percolation ⋮ A note on the irregularity of graphs ⋮ The sum of the squares of degrees: sharp asymptotics ⋮ Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case ⋮ Extreme values of the sum of squares of degrees of bipartite graphs ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Optimization of functionals containing functions and their inverses
• Rearrangements of \((0,-1)\) matrices
• Rearrangements of square matrices with non-negative elements
• An Extremal Problem Involving Functions and Their Inverses.

This page was built for publication: A problem in rearrangements of (0,1)-matrices