A General Criterion for the Existence of Transversals
From MaRDI portal
Publication:3671986
DOI10.1112/plms/s3-47.1.43zbMath0522.05002OpenAlexW2024771000MaRDI QIDQ3671986
Saharon 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
Related Items (17)
Matchings in infinite graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Transversals and bipancyclicity in bipartite graph families ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ Matching variables to equations in infinite linear equation systems ⋮ The countable Erdős-Menger conjecture with ends ⋮ Infinite matching theory ⋮ Matchings from a set below to a set above ⋮ All trees are 1-embeddable and all except stars are 2-embeddable ⋮ The Erdős-Menger conjecture for source/sink sets with disjoint closures ⋮ Unnamed Item ⋮ Menger's theorem for infinite graphs ⋮ Counting 1-factors in infinite graphs ⋮ A compactness theorem for perfect matchings in matroids ⋮ A generalization of Tutte's 1-factor theorem to countable graphs ⋮ Set systems with finite chromatic number ⋮ Combinatorics of reductions between equivalence relations
This page was built for publication: A General Criterion for the Existence of Transversals