Graphs and matching theorems
From MaRDI portal
Cited in
(45)- Some sequences associated with combinatorial structures
- Trees with 1-factors and oriented trees
- Matching theory -- a sampler: From Dénes König to the present
- The strong Hall property and symmetric chain orders
- Independent transversals in \(r\)-partite graphs
- Elementary strong maps and transversal geometries
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
- Some recent results in combinatorial approaches to dynamical systems
- Chromatic polynomials and broken cycles
- An improved linear connectivity bound for tournaments to be highly linked
- Skew-amenability of topological groups
- Computing valuations of the Dieudonné determinants
- Applications of Menger's graph theorem
- Transversal theory and the study of abstract independence
- Hall's criterion as a 'self-refining' result
- Matching problems
- Generalized versions of Hall's theorem
- On distinct representatives and mapping theorems
- An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion
- Duality and optimality of auctions for uniform distributions
- Graphs and Subgraphs
- Matrices of zeros and ones
- A probabilistic solution of problem 111. of G. Birkhoff
- On the irreducibility of layered mixed matrices
- Critical sets in bipartite graphs
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
- scientific article; zbMATH DE number 3679881 (Why is no real title available?)
- Einige Aspekte in der Zuordnungstheorie
- Matching theorems for combinatorial geometries
- On Følner sets in topological groups
- A structural approach to state-to-output decoupling
- Some applications of a theorem of Rado
- Matching Theory for Combinatorial Geometries
- scientific article; zbMATH DE number 3375554 (Why is no real title available?)
- The binding number of a graph and its Anderson number
- The structure of Sperner k-families
- Systems of representatives
- The structure of Sperner k-families
- Couplings and matchings: combinatorial notes on Strassen's theorem
- A unified combinatorial view beyond some spectral properties
- A new connectivity bound for a tournament to be highly linked
- New Menger-like dualities in digraphs and applications to half-integral linkages
- On invariant means and pre-syndetic subgroups
- Optimal and near-optimal broadcast in random graphs
This page was built for publication: Graphs and matching theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766882)
