Combinatorial Properties of Matrices of Zeros and Ones
From MaRDI portal
Publication:3246338
DOI10.4153/CJM-1957-044-3zbMATH Open0079.01102OpenAlexW4246168648MaRDI QIDQ3246338FDOQ3246338
Authors: Herbert John Ryser
Publication date: 1957
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1957-044-3
Cited In (only showing first 100 items - show all)
- On an inequality of A. Khintchine for zero-one matrices
- Bipartite regulation numbers
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Solving some instances of the 2-color problem
- Binary matrices under the microscope: A tomographical problem
- On the eigenvalues of the structure matrix of matrices of zeros and ones
- Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
- Scanning integer matrices by means of two rectangular windows
- Matrices of rational integers
- Existence and constructions of connected block designs with given vectors of treatment replications and block sizes
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- New linearizations of quadratic assignment problems
- On the number of zero-patterns of a sequence of polynomials
- Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
- Inequalities and existence theorems in the theory of matrices
- Witt vectors. I
- Arranging apples in an array
- Matrices with prescribed row, column and block sums
- Configuring random graph models with fixed degree sequences
- 2-partition-transitive tournaments
- Asymptotic enumeration of lonesum matrices
- On double-resolution imaging and discrete tomography
- Optimization over degree sequences
- On assignment functions
- On matching numbers of tree and bipartite degree sequences
- Invariant Sets for Classes of Matrices of Zeros and Ones
- Matrices uniquely determined by their lonesums
- Dually vertex-oblique graphs
- The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
- An experimental study of the stability problem in discrete tomography
- The bipartite-splittance of a bipartite graph
- Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Degree sequences and majorization
- On the little secondary Bruhat order
- Systems of representatives
- The 1-Color Problem and the Brylawski Model
- A reconstruction algorithm for a subclass of instances of the 2-color problem
- On the use of graphs in discrete tomography
- Combinatorial aspects of poly-Bernoulli polynomials and poly-Euler numbers
- Graphs with given valences
- On d-invariant transformations of (\(p,s\))-digraphs
- The class A(R,S) of (0,1)-matrices
- Triangular (0,1)-matrices with prescribed row and column sums
- Dynamic discrete tomography
- Uniform sampling of digraphs with a fixed degree sequence
- Optimization and reconstruction of hv-convex (0,1)-matrices
- The class of matrices of zeros, ones, and twos with prescribed row and column sums
- A network flow algorithm for reconstructing binary images from discrete X-rays
- A majorization theorem for the C-matrices of binary designs
- Combinatorial properties of poly-Bernoulli relatives
- An evolutionary algorithm for discrete tomography
- A sufficient condition for non-uniqueness in binary tomography with absorption
- Reconstruction of Convex Sets from One or Two X-rays
- On Ryser's maximum term rank formula
- Reconstruction of discrete sets with absorption
- On normal matrices of zeros and ones with fixed row sum
- Market implementation of multiple-arrival multiple-deadline differentiated energy services
- Stuttering blocks of Ariki-Koike algebras
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- On 12-regular nut graphs
- Number of 1-factorizations of regular high-degree graphs
- The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
- Rejection sampling of bipartite graphs with given degree sequence
- Relaxed and approximate graph realizations
- Wide partitions, Latin tableaux, and Rota's basis conjecture
- Gram mates, sign changes in singular values, and isomorphism
- Planar bipartite biregular degree sequences
- Spatiotemporal conditional inference and hypothesis tests for neural ensemble spiking precision
- A minimal completion of \((0,1)\)-matrices without total support
- Transitive partitions in realizations of tournament score sequences
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
- Leaf realization problem, caterpillar graphs and prefix normal words
- Neighborhood degree lists of graphs
- Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
- Algorithms for linear time reconstruction by discrete tomography. II
- Uniform and monotone line sum optimization
- The relationship between the class \({\mathfrak A}_2(R,S)\) of (0, 1, 2)-matrices and the collection of constellation matrices
- On line sum optimization
- Matrices of zeros and ones with the maximum jump number
- On the bipartite graph packing problem
- Recursion formulas for poly-Bernoulli numbers and their applications
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- A geometrical characterization of regions of uniqueness and applications to discrete tomography
- Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
- Alternating signed bipartite graphs and difference-1 colourings
- On the properties of interchange operations in classes of \((0,1)\)- matrices
- Graphs and degree sequences. I
- On the enumeration of rectangular (0, 1)-matrices
- Minimum degree conditions for the strength and bandwidth of graphs
- On factorable bigraphic pairs
- Multidimensional matrices uniquely recovered by their lines
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
- On some geometric aspects of the class of \(hv\)-convex switching components
- Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
- On vertex-weighted realizations of acyclic and general graphs
- Lonesum decomposable matrices
- Improved queue-size scaling for input-queued switches via graph factorization
- Randomization methods for assessing data analysis results on real‐valued matrices
This page was built for publication: Combinatorial Properties of Matrices of Zeros and Ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3246338)