Fair representation by independent sets

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10369121" target="_blank" >RIV/00216208:11320/17:10369121 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-319-44479-6_2" target="_blank" >http://dx.doi.org/10.1007/978-3-319-44479-6_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-44479-6_2" target="_blank" >10.1007/978-3-319-44479-6_2</a>

Result language

angličtina

Original language name

Fair representation by independent sets

Original language description

We look for classes of hypergraphs H in which any partition of V (H) can be represented almost fairly by some edge. We show that this is true when H is the set of independent sets in a path, and conjecture that it is true when H is the set of matchings in K_n, n . We prove that partitions of E(K_n, n) into three sets can be represented almost fairly. The methods of proofs are topological.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA13-21988S" target="_blank" >GA13-21988S: Enumeration in informatics and optimization</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Book/collection name

A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek

ISBN

978-3-319-44478-9

Number of pages of the result

28

Pages from-to

31-58

Number of pages of the book

810

Publisher name

Springer International Publishing

Place of publication

Neuveden

UT code for WoS chapter

—