Graphs and matching theorems

Cited in

(42)

Some sequences associated with combinatorial structures
Chromatic polynomials and broken cycles
The structure of Sperner k-families
Generalized versions of Hall's theorem
Couplings and matchings: combinatorial notes on Strassen's theorem
Some recent results in combinatorial approaches to dynamical systems
Elementary strong maps and transversal geometries
Transversal theory and the study of abstract independence
Hall's criterion as a 'self-refining' result
Matching problems
Duality and optimality of auctions for uniform distributions
An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion
Einige Aspekte in der Zuordnungstheorie
A probabilistic solution of problem 111. of G. Birkhoff
The strong Hall property and symmetric chain orders
Trees with 1-factors and oriented trees
Matching theory -- a sampler: From Dénes König to the present
A structural approach to state-to-output decoupling
Optimal and near-optimal broadcast in random graphs
Some applications of a theorem of Rado
scientific article; zbMATH DE number 3679881 (Why is no real title available?)
A unified combinatorial view beyond some spectral properties
The structure of Sperner k-families
On the irreducibility of layered mixed matrices
Systems of representatives
Graphs and Subgraphs
Matrices of zeros and ones
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
Matching Theory for Combinatorial Geometries
On Følner sets in topological groups
Skew-amenability of topological groups
Critical sets in bipartite graphs
Applications of Menger's graph theorem
Computing valuations of the Dieudonné determinants
Independent transversals in \(r\)-partite graphs
An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
scientific article; zbMATH DE number 3375554 (Why is no real title available?)
An improved linear connectivity bound for tournaments to be highly linked
The binding number of a graph and its Anderson number
On distinct representatives and mapping theorems
Matching theorems for combinatorial geometries

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)