Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
Advances in Combinatorics
Année 2020
Précédent
Suivant
Tome (2020)
Sommaire
Unitary Signings and Induced Subgraphs of Cayley Graphs of
$\mathbb{Z}_2^{n}$
Noga Alon
;
Kai Zheng
The Maximum Number of Triangles in a Graph of Given Maximum Degree
Zachary Chase
Tangles are Decided by Weighted Vertex Sets
Christian Elbracht
;
Jay Lilian Kneip
;
Maximilian Teegen
Graphs of bounded cliquewidth are polynomially
$χ$
-bounded
Marthe Bonamy
;
Michał Pilipczuk
Large independent sets in triangle-free cubic graphs: beyond planarity
Wouter Cames van Batenburg
;
Jan Goedgebeur
;
Gwenaël Joret
The Bandwidth Theorem in Sparse Graphs
Peter Allen
;
Julia Böttcher
;
Julia Ehrenmüller
;
Anusch Taraz
Planar graphs have bounded nonrepetitive chromatic number
Vida Dujmović
;
Louis Esperet
;
Gwenaël Joret
;
Bartosz Walczak
;
David R. Wood
Improved bounds for the Erdős-Rogers function
W. T. Gowers
;
O. Janzer
A Completion of the Proof of the Edge-statistics Conjecture
Jacob Fox
;
Lisa Sauermann
Tight paths in convex geometric hypergraphs
Zoltán F\" uredi
;
Tao Jiang
;
Alexandr Kostochka
;
Dhruv Mubayi
;
Jacques Verstraëte
A rainbow version of Mantel's Theorem
Ron Aharoni
;
Matt DeVos
;
Sebastián González Hermosillo de la Maza
;
Amanda Montejano
;
Robert Šámal