Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Mathematics > Combinatorics

arXiv:1809.03268 (math)
[Submitted on 10 Sep 2018]

Title:Fair splittings by independent sets in sparse graphs

Authors:Alexander Black, Umur Cetin, Florian Frick, Alexander Pacun, Linus Setiabrata
View a PDF of the paper titled Fair splittings by independent sets in sparse graphs, by Alexander Black and 4 other authors
View PDF HTML (experimental)
Abstract:Given a partition $V_1 \sqcup V_2 \sqcup \dots \sqcup V_m$ of the vertex set of a graph, we are interested in finding multiple disjoint independent sets that contain the correct fraction of vertices of each $V_j$. We give conditions for the existence of $q$ such independent sets in terms of the topology of the independence complex. We relate this question to the existence of $q$-fold points of coincidence for any continuous map from the independence complex to Euclidean space of a certain dimension, and to the existence of equivariant maps from the $q$-fold deleted join of the independence complex to a certain representation sphere of the symmetric group. As a corollary we derive the existence of $q$ pairwise disjoint independent sets accurately representing the $V_j$ in certain sparse graphs for $q$ a power of a prime.
Comments: 14 pages
Subjects: Combinatorics (math.CO)
MSC classes: 05C69, 05C15, 52A35
Cite as: arXiv:1809.03268 [math.CO]
  (or arXiv:1809.03268v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.1809.03268
arXiv-issued DOI via DataCite
Journal reference: Israel J. Math. 236, 603-627 (2020)

Submission history

From: Florian Frick [view email]
[v1] Mon, 10 Sep 2018 12:28:28 UTC (18 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Fair splittings by independent sets in sparse graphs, by Alexander Black and 4 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

math.CO
< prev   |   next >
new | recent | 2018-09
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences