A General Criterion for the Existence of Transversals
From MaRDI portal
Publication:3671986
Cited in
(19)- Counting 1-factors in infinite graphs
- Combinatorics of reductions between equivalence relations
- Graph factors and factorization: 1985--2003: a survey
- Menger's theorem for infinite graphs
- The Lovász-Cherkassky theorem in infinite graphs
- Transversals and bipancyclicity in bipartite graph families
- A compactness theorem for perfect matchings in matroids
- Matchings from a set below to a set above
- The countable Erdős-Menger conjecture with ends
- The Erdős-Menger conjecture for source/sink sets with disjoint closures
- All trees are 1-embeddable and all except stars are 2-embeddable
- Set systems with finite chromatic number
- Matchings in infinite graphs
- Matching variables to equations in infinite linear equation systems
- On the packing/covering conjecture of infinite matroids
- Infinite matching theory
- A generalization of Tutte's 1-factor theorem to countable graphs
- The Lovász-Cherkassky theorem in countable graphs
- scientific article; zbMATH DE number 7535269 (Why is no real title available?)
This page was built for publication: A General Criterion for the Existence of Transversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671986)