Choice functions

DOI10.1007/S11083-022-09604-8MaRDI QIDQ6105041zbMATH OpenFDO

Authors Ron Aharoni, Joseph Briggs

Publication date 26 June 2023

Published in Order (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.12881

zbMATH Keywords

independent setsmatchingsrainbow sets

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: This is a survey paper on rainbow sets (another name for ``choice functions). The main theme is the distinction between two types of choice functions: those having a large (in the sense of belonging to some specified filter, namely closed up set of sets) image, and those that have a large domain and small image, where ``smallness means belonging to some specified complex (a closed-down set). The paper contains some new results: (1) theorems on scrambled versions, in which the sets are re-shuffled before choosing the rainbow set, and (2) results on weighted and cooperative versions - to be defined below.

Recommendations

• Choice functions in the intersection of matroids
• Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
• scientific article; zbMATH DE number 3885585
• Choice functions and abstract convex geometries
• On final choice functions

Cites work

• A condition for matchability in hypergraphs
• A generalization of Caratheodory's theorem
• A THEOREM ON INDEPENDENCE RELATIONS
• A topological colorful Helly theorem
• A weak version of Rota's bases conjecture for odd dimensions
• An n n Latin square has a transversal with at least n- n distinct symbols
• An approximate version of a conjecture of Aharoni and Berger
• Badges and rainbow matchings
• Cooperative conditions for the existence of rainbow matchings
• Domination numbers and homology
• Finding Large Independent Sets in Graphs and Hypergraphs
• Flattening rank and its combinatorial applications
• Full rainbow matchings in graphs and hypergraphs
• Halfway to Rota’s Basis Conjecture
• Hall's theorem for hypergraphs
• scientific article; zbMATH DE number 3630786 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Improved lower bounds on k‐independence
• Large rainbow matchings in general graphs
• Leray numbers of complexes of graphs with bounded matching number
• List coloring of two matroids through reduction to partition matroids
• Note: Combinatorial Alexander duality -- a short and elementary proof
• On Representatives of Subsets
• On the Strong Chromatic Number
• Points surrounding the origin
• Rainbow fractional matchings
• Rainbow matchings in r-partite r-graphs
• Rainbow matchings in bipartite multigraphs
• Rainbow matchings in properly colored multigraphs
• Rainbow Odd Cycles
• Rainbow sets in the intersection of two matroids: a generalization of results of Drisko and Chappell
• Rainbow triangles and the Caccetta-Häggkvist conjecture
• The edge covering number of the intersection of two matroids
• The intersection of a matroid and a simplicial complex
• Transversals in row-latin rectangles
• Transversals of latin squares and their generalizations
• Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv

Cited in

(5)

• A system of disjoint representatives of line segments with given \(k\) directions
• Choice functions in the intersection of matroids
• Designer path independent choice functions
• scientific article; zbMATH DE number 3995386 (Why is no real title available?)
• Recognition of choice functions

This page was built for publication: Choice functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6105041)