Fair splittings by independent sets in sparse graphs

DOI10.1007/s11856-020-1980-5zbMath1439.05183arXiv1809.03268OpenAlexW3005926255MaRDI QIDQ2182042

Umur Cetin, Alexander Black, Alexander Pacun, Linus Setiabrata, Florian Frick

Publication date: 20 May 2020

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items

Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets ⋮ The complexity of finding fair independent sets in cycles

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic number of almost stable Kneser hypergraphs
• A local criterion for Tverberg graphs
• Tverberg's theorem with constraints
• The linear arboricity of graphs
• Probabilistic methods in coloring and decomposition problems
• Generalized Kneser coloring theorems with combinatorial proofs
• A condition for matchability in hypergraphs
• Optimal bounds for the colored Tverberg problem
• Fair splitting of colored paths
• Kuratowski complexes
• A Note on Vertex List Colouring
• Tverberg plus constraints
• Intersection patterns of finite sets and of convex sets
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
• The Chromatic Number of Kneser Hypergraphs
• Fair Representation by Independent Sets
• Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems
• A Generalization of Radon's Theorem
• Classifying unavoidable Tverberg partitions
• 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

This page was built for publication: Fair splittings by independent sets in sparse graphs