Graphs and matching theorems

From MaRDI portal
Revision as of 10:26, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:766882

DOI10.1215/S0012-7094-55-02268-7zbMath0068.16301MaRDI QIDQ766882

No author found.

Publication date: 1955

Published in: Duke Mathematical Journal (Search for Journal in Brave)




Related Items (41)

Some applications of a theorem of RadoSelling two goods optimallyStructural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—On the irreducibility of layered mixed matricesCritical sets in bipartite graphsIndependent transversals in \(r\)-partite graphsUnnamed ItemCombinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear EquationsElementary strong maps and transversal geometriesMatrices of zeros and onesOptimal and near-optimal broadcast in random graphsTrees with 1-factors and oriented treesA probabilistic solution of problem 111. of G. BirkhoffMatching Theory for Combinatorial GeometriesEinige Aspekte in der ZuordnungstheorieAn improved linear connectivity bound for tournaments to be highly linkedOn Følner sets in topological groupsMatching theory -- a sampler: From Dénes König to the presentAn improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletionThe structure of Sperner k-familiesThe binding number of a graph and its Anderson numberMatching theorems for combinatorial geometriesUnnamed ItemAn Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex DeletionA Structural Approach to State-to-Output DecouplingApplications of Menger's graph theoremSystems of representativesTransversal theory and the study of abstract independenceHall's criterion as a 'self-refining' resultGraphs and SubgraphsMatching problemsSome recent results in combinatorial approaches to dynamical systemsGeneralized versions of Hall's theoremThe structure of Sperner k-familiesSkew-amenability of topological groupsOn distinct representatives and mapping theoremsChromatic polynomials and broken cyclesThe strong Hall property and symmetric chain ordersComputing valuations of the Dieudonné determinantsDuality and Optimality of Auctions for Uniform DistributionsSome sequences associated with combinatorial structures







This page was built for publication: Graphs and matching theorems