About: Covering a graph by forests and a matching     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • We prove that for any positive integer k, the edges of any graph whose fractional arboricity is at most k + 1/(3k+2) can be decomposed into k forests and a matching. This is a partial result in the direction of the `Nine Dragon Tree' conjecture of Montassier et al.
  • We prove that for any positive integer k, the edges of any graph whose fractional arboricity is at most k + 1/(3k+2) can be decomposed into k forests and a matching. This is a partial result in the direction of the `Nine Dragon Tree' conjecture of Montassier et al. (en)
Title
  • Covering a graph by forests and a matching
  • Covering a graph by forests and a matching (en)
skos:prefLabel
  • Covering a graph by forests and a matching
  • Covering a graph by forests and a matching (en)
skos:notation
  • RIV/49777513:23520/11:43896448!RIV12-GA0-23520___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/09/0197), Z(MSM4977751301)
http://linked.open...iv/cisloPeriodika
  • 4
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 192146
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/11:43896448
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • fractional arboricity, forest, matching, decomposition (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [CB3C1F08141C]
http://linked.open...i/riv/nazevZdroje
  • SIAM JOURNAL ON DISCRETE MATHEMATICS
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 25
http://linked.open...iv/tvurceVysledku
  • Kaiser, Tomáš
  • Montassier, Mickaël
  • Raspaud, André
http://linked.open...n/vavai/riv/zamer
issn
  • 0895-4801
number of pages
http://bibframe.org/vocab/doi
  • 10.1137/100818340
http://localhost/t...ganizacniJednotka
  • 23520
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software