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”

Star-Forest Decompositions of Complete Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10491476" target="_blank" >RIV/00216208:11320/24:10491476 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-63021-7_10" target="_blank" >https://doi.org/10.1007/978-3-031-63021-7_10</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-63021-7_10" target="_blank" >10.1007/978-3-031-63021-7_10</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Star-Forest Decompositions of Complete Graphs

  • Original language description

    We deal with the problem of decomposing a complete geometric graph into plane star-forests. In particular, we disprove a recent conjecture by Pach, Saghafian and Schnider by constructing for each n a complete geometric graph on n vertices which can be decomposed into [n/2] + 1 plane star-forests. Additionally we prove that for even n, every decomposition of a complete abstract graph on n vertices into n/2 + 1 star-forests is composed of a perfect matching and n/2 star-forests with two edge-balanced components, which we call broken double stars.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

    <a href="/en/project/GX23-04949X" target="_blank" >GX23-04949X: Fundamental questions of discrete geometry</a><br>

  • Continuities

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

Others

  • Publication year

    2024

  • 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

  • Article name in the collection

    COMBINATORIAL ALGORITHMS, IWOCA 2024

  • ISBN

    978-3-031-63020-0

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    12

  • Pages from-to

    126-137

  • Publisher name

    SPRINGER INTERNATIONAL PUBLISHING AG

  • Place of publication

    CHAM

  • Event location

    Ischia

  • Event date

    Jul 1, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001282050500010