Fair Representation by Independent Sets
From MaRDI portal
Publication:4604368
DOI10.1007/978-3-319-44479-6_2zbMath1387.05170arXiv1611.03196OpenAlexW2567004493MaRDI QIDQ4604368
Dani Kotlar, Noga Alon, Maria Chudnovsky, Ran Ziv, Martin Loebl, Eli Berger, Ron Aharoni
Publication date: 26 February 2018
Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03196
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
Fair splitting of colored paths ⋮ Fair representation in the intersection of two matroids ⋮ Fair splittings by independent sets in sparse graphs ⋮ On a conjecture of Stein ⋮ Fair representation in dimatroids ⋮ On finding constrained independent sets in cycles ⋮ Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets ⋮ Almost fair perfect matchings in complete bipartite graphs ⋮ A counterexample to Stein’s Equi-$n$-square Conjecture ⋮ The complexity of finding fair independent sets in cycles
Cites Work
- Unnamed Item
- A proof of Snevily's conjecture.
- Extremal problems for transversals in graphs with bounded degree
- Splitting necklaces
- The linear arboricity of graphs
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- Transversals of latin squares and their generalizations
- The Hamiltonian property of consecutive-\(d\) digraphs
- Probabilistic methods in coloring and decomposition problems
- Independent transversals in \(r\)-partite graphs
- Special parity of perfect matchings in bipartite graphs
- A condition for matchability in hypergraphs
- Cooperative colorings and independent systems of representatives
- Independent systems of representatives in weighted graphs
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
- Complete Subgraphs of r-partite Graphs
- Hall's theorem for hypergraphs
- Combinatorial Matrix Theory
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Multipartite hypergraphs achieving equality in Ryser's conjecture
This page was built for publication: Fair Representation by Independent Sets