A General Criterion for the Existence of Transversals

DOI10.1112/PLMS/S3-47.1.43MaRDI QIDQ3671986zbMATH OpenOpenAlexFDO

Authors Ron Aharoni, C. St. J. A. Nash-Williams, S. Shelah

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

zbMATH Keywords

espousalfamily of subsetsimpedimentinfinite cardinalsmarriage in societiestransversal

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Permutations, words, matrices (05A05)

Cited in

(22)

• Menger's theorem for infinite graphs
• Matchings in infinite graphs
• Infinite matching theory
• Matchings from a set below to a set above
• The countable Erdős-Menger conjecture with ends
• Counting 1-factors in infinite graphs
• A compactness theorem for perfect matchings in matroids
• Combinatorics of reductions between equivalence relations
• Transversals and bipancyclicity in bipartite graph families
• The Lovász-Cherkassky theorem in countable graphs
• Matching variables to equations in infinite linear equation systems
• scientific article; zbMATH DE number 7535269 (Why is no real title available?)
• On the packing/covering conjecture of infinite matroids
• The Lovász-Cherkassky theorem in infinite graphs
• All trees are 1-embeddable and all except stars are 2-embeddable
• Hall's marriage theorem
• Transversal panconnectedness in graph collections
• The Erdős-Menger conjecture for source/sink sets with disjoint closures
• Transversal Hamilton paths and cycles
• A generalization of Tutte's 1-factor theorem to countable graphs
• Set systems with finite chromatic number
• Graph factors and factorization: 1985--2003: a survey

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)