DeepAI AI Chat
Log In Sign Up

The Complexity of Finding Fair Independent Sets in Cycles

by   Ishay Haviv, et al.

Let G be a cycle graph and let V_1,…,V_m be a partition of its vertex set into m sets. An independent set S of G is said to fairly represent the partition if |S ∩ V_i| ≥1/2· |V_i| -1 for all i ∈ [m]. It is known that for every cycle and every partition of its vertex set, there exists an independent set that fairly represents the partition (Aharoni et al., A Journey through Discrete Math., 2017). We prove that the problem of finding such an independent set is 𝖯𝖯𝖠-complete. As an application, we show that the problem of finding a monochromatic edge in a Schrijver graph, given a succinct representation of a coloring that uses fewer colors than its chromatic number, is 𝖯𝖯𝖠-complete as well. The work is motivated by the computational aspects of the `cycle plus triangles' problem and of its extensions.


page 1

page 2

page 3

page 4


The Complexity of the Partition Coloring Problem

Given a simple undirected graph G=(V,E) and a partition of the vertex se...

Degree-constrained 2-partitions of graphs

A (δ≥ k_1,δ≥ k_2)-partition of a graph G is a vertex-partition (V_1,V_2)...

Constant Inapproximability for PPA

In the ε-Consensus-Halving problem, we are given n probability measures ...

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids

The present note is a strengthening of a recent paper by K. Takazawa and...

P not equal to NP

Let G(V,E) be a graph with vertex set V and edge set E, and let X be eit...

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...

Extending Edge-colorings of Complete Hypergraphs into Regular Colorings

Let Xh be the collection of all h-subsets of an n-set X⊇ Y. Given a colo...