Journal of combinatorial theory. Series B
Año 2015, Número 115
Sparse halves in dense triangle-free graphs
Sergey Norin, Liana Yepremyan
págs. 1-25
Coloring perfect graphs with no balanced skew-partitions
Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic
págs. 26-65
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
Zoltán Füredi
págs. 66-71
Decomposing a graph into pseudoforests with one having bounded degree
Genghua Fan, Yan Li, Ning Song, Daqing Yan
págs. 72-95
Dániel T. Soukup
págs. 96-116
Möbius conjugation and convolution formulae
Suijie Wang
págs. 117-131
On the number of monotone sequences
Wojciech Samotij, Benny Sudakov
págs. 132-163
Comparable pairs in families of sets
Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov
págs. 164-185
On the chromatic number of general Kneser hypergraphs
Meysam Alishahi, Hossein Hajiabolhassan
págs. 186-209
Coloring digraphs with forbidden cycles
Zhibin Chen, Jie Ma, Wenan Zang
págs. 210-223
Dan McQuillan, Shengjun Pan, R. Bruce Richter
págs. 224-235
Maximizing proper colorings on graphs
Jie Ma, Humberto Naves
págs. 236-275
Edge-colouring seven-regular planar graphs
Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour
págs. 276-302
Edge-colouring eight-regular planar graphs
Maria Chudnovsky, Katherine Edwards, Paul D. Seymour
págs. 303-338
Alexey PokrovskiY
págs. 339-347
- Página 1 de 1
