Geodesic
The bandwidth theorem for locally dense graphs
Forum of Mathematics, Sigma, Tome 8 (2020)

Voir la notice de l'article provenant de la source Cambridge University Press

The bandwidth theorem of Böttcher, Schacht, and Taraz [Proof of the bandwidth conjecture of Bollobás and Komlós, Mathematische Annalen, 2009] gives a condition on the minimum degree of an n-vertex graph G that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth $o(n)$, thereby proving a conjecture of Bollobás and Komlós [The Blow-up Lemma, Combinatorics, Probability, and Computing, 1999]. In this paper, we prove a version of the bandwidth theorem for locally dense graphs. Indeed, we prove that every locally dense n-vertex graph G with $\delta (G)> (1/2+o(1))n$ contains as a subgraph any given (spanning) H with bounded maximum degree and sublinear bandwidth. 
@article{10_1017_fms_2020_39,
     author = {Katherine Staden and Andrew Treglown},
     title = {The bandwidth theorem for locally dense graphs},
     journal = {Forum of Mathematics, Sigma},
     publisher = {mathdoc},
     volume = {8},
     year = {2020},
     doi = {10.1017/fms.2020.39},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/fms.2020.39/}
}
TY  - JOUR
AU  - Katherine Staden
AU  - Andrew Treglown
TI  - The bandwidth theorem for locally dense graphs
JO  - Forum of Mathematics, Sigma
PY  - 2020
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.1017/fms.2020.39/
DO  - 10.1017/fms.2020.39
LA  - en
ID  - 10_1017_fms_2020_39
ER  - 
%0 Journal Article
%A Katherine Staden
%A Andrew Treglown
%T The bandwidth theorem for locally dense graphs
%J Forum of Mathematics, Sigma
%D 2020
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.1017/fms.2020.39/
%R 10.1017/fms.2020.39
%G en
%F 10_1017_fms_2020_39
Katherine Staden; Andrew Treglown. The bandwidth theorem for locally dense graphs. Forum of Mathematics, Sigma, Tome 8 (2020). doi: 10.1017/fms.2020.39

Cité par Sources :