Choice functions
From MaRDI portal
Publication:6105041
DOI10.1007/s11083-022-09604-8zbMath1517.05129arXiv2107.12881MaRDI QIDQ6105041
Publication date: 26 June 2023
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.12881
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Rainbow matchings in bipartite multigraphs
- The edge covering number of the intersection of two matroids
- A topological colorful Helly theorem
- Note: Combinatorial Alexander duality -- a short and elementary proof
- Points surrounding the origin
- A generalization of Caratheodory's theorem
- Transversals of latin squares and their generalizations
- An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
- Transversals in row-latin rectangles
- Domination numbers and homology
- An approximate version of a conjecture of Aharoni and Berger
- A condition for matchability in hypergraphs
- Badges and rainbow matchings
- Flattening rank and its combinatorial applications
- Cooperative conditions for the existence of rainbow matchings
- Leray numbers of complexes of graphs with bounded matching number
- Rainbow fractional matchings
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
- Large rainbow matchings in general graphs
- Rainbow sets in the intersection of two matroids: a generalization of results of Drisko and Chappell
- Rainbow Matchings in Properly Colored Multigraphs
- Rainbow triangles and the Caccetta‐Häggkvist conjecture
- The intersection of a matroid and a simplicial complex
- Improved lower bounds on k‐independence
- Hall's theorem for hypergraphs
- On the Strong Chromatic Number
- On Representatives of Subsets
- A Weak Version of Rota's Bases Conjecture for Odd Dimensions
- List Coloring of Two Matroids through Reduction to Partition Matroids
- Rainbow Odd Cycles
- Finding Large Independent Sets in Graphs and Hypergraphs
- A THEOREM ON INDEPENDENCE RELATIONS
- Halfway to Rota’s Basis Conjecture
- Full rainbow matchings in graphs and hypergraphs
This page was built for publication: Choice functions
