All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Majority colorings of sparse digraphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F21%3A00125298" target="_blank" >RIV/00216224:14330/21:00125298 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.37236/10067" target="_blank" >http://dx.doi.org/10.37236/10067</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.37236/10067" target="_blank" >10.37236/10067</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Majority colorings of sparse digraphs

  • Original language description

    A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen and Wood proved that every digraph has a majority 4-coloring and conjectured that every digraph admits a majority 3-coloring. They observed that the Local Lemma implies the conjecture for digraphs of large enough minimum out-degree if, crucially, the maximum in-degree is bounded by a(n exponential) function of the minimum out-degree. Our goal in this paper is to develop alternative methods that allow the verification of the conjecture for natural, broad digraph classes, without any restriction on the in-degrees. Among others, we prove the conjecture 1) for digraphs with chromatic number at most 6 or dichromatic number at most 3, and thus for all planar digraphs; and 2) for digraphs with maximum out-degree at most 4. The benchmark case of r-regular digraphs remains open for r is an element of[5, 143]. Our inductive proofs depend on loaded inductive statements about precoloring extensions of list-colorings. This approach also gives rise to stronger conclusions, involving the choosability version of majority coloring. We also give further evidence towards the existence of majority-3-colorings by showing that every digraph has a fractional majority 3.9602-coloring. Moreover we show that every digraph with large enough minimum out-degree has a fractional majority (2 + epsilon)-coloring.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Electronic Journal of Combinatorics

  • ISSN

    1077-8926

  • e-ISSN

  • Volume of the periodical

    28

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    17

  • Pages from-to

    1-17

  • UT code for WoS article

    000670355400001

  • EID of the result in the Scopus database

    2-s2.0-85107211371