A General Criterion for the Existence of Transversals
From MaRDI portal
Publication:3671986
DOI10.1112/PLMS/S3-47.1.43zbMATH Open0522.05002OpenAlexW2024771000MaRDI QIDQ3671986FDOQ3671986
S. Shelah, Ron Aharoni, C. St. J. A. Nash-Williams
Publication date: 1983
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-47.1.43
Cited In (19)
- All trees are 1-embeddable and all except stars are 2-embeddable
- Menger's theorem for infinite graphs
- On the packing/covering conjecture of infinite matroids
- Combinatorics of reductions between equivalence relations
- The countable Erdős-Menger conjecture with ends
- The Erdős-Menger conjecture for source/sink sets with disjoint closures
- Transversals and bipancyclicity in bipartite graph families
- Counting 1-factors in infinite graphs
- Infinite matching theory
- Matching variables to equations in infinite linear equation systems
- The Lovász-Cherkassky theorem in infinite graphs
- Matchings from a set below to a set above
- Graph factors and factorization: 1985--2003: a survey
- A generalization of Tutte's 1-factor theorem to countable graphs
- Set systems with finite chromatic number
- A compactness theorem for perfect matchings in matroids
- Matchings in infinite graphs
- The Lovász-Cherkassky theorem in countable graphs
- Title not available (Why is that?)
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)