Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree

Bruce Reed; Guillem Perarnau

doi:10.1017/S0963548316000328

Article Dans Une Revue Combinatorics, Probability and Computing Année : 2017

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree

(1, 2) , (3)

1
2
3

Bruce Reed

Fonction : Auteur
PersonId : 16119
IdHAL : bruce-reed
IdRef : 070517665

Combinatorics, Optimization and Algorithms for Telecommunications

IRATO / Kawarabayashi Large Graph Project [Japan]

Guillem Perarnau

Fonction : Auteur

Department of Mathematics [Birmingham, Alabama]

Domaines

Combinatoire [math.CO]

Bruce Reed : Connectez-vous pour contacter le contributeur

https://hal.science/hal-01641020

Soumis le : lundi 20 novembre 2017-22:37:44

Dernière modification le : jeudi 14 mars 2024-03:12:04

Dates et versions

hal-01641020 , version 1 (20-11-2017)

Identifiants

HAL Id : hal-01641020 , version 1
ARXIV : 1404.7764
DOI : 10.1017/S0963548316000328

Citer

Bruce Reed, Guillem Perarnau. Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Combinatorics, Probability and Computing, 2017, 26 (03), pp.448 - 467. ⟨10.1017/S0963548316000328⟩. ⟨hal-01641020⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA I3S INRIA2 UNIV-COTEDAZUR

348 Consultations

0 Téléchargements

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree

Domaines

Dates et versions

Identifiants

Citer

Exporter

Collections

Altmetric

Partager