Hypergraph coloring up to condensation von Ayre, Peter, Coja‐Oghlan, Amin, Greenhill, Catherine

Volltext

On deficiency problems for graphs von Freschi, Andrea, Hyde, Joseph, Treglown, Andrew

Volltext

Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths von Chiu, Yung-Chung, Lu, Hsueh-I

Volltext

A Menger-like property of tree-cut width von Giannopoulou, Archontia C., Kwon, O-joung, Raymond, Jean-Florent, Thilikos, Dimitrios M.

Volltext

KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH von Röllin, Adrian

Volltext

Recognizing Helly Edge-Path-Tree graphs and their clique graphs von Apollonio, Nicola, Caramia, Massimiliano

Volltext

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 von Dvořák, Zdeněk, Postle, Luke

Volltext

A note on the maximum number of triangles in a C5-free graph von Ergemlidze, Beka, Győri, Ervin, Methuku, Abhishek, Salia, Nika

Volltext

Induced minors and well-quasi-ordering von Błasiok, Jarosław, Kamiński, Marcin, Raymond, Jean-Florent, Trunck, Théophile

Volltext

Induced minors and well-quasi-ordering von Błasiok, Jarosław, Kamiński, Marcin, Raymond, Jean-Florent, Trunck, Théophile

Volltext

A dual version of the Brooks group coloring theorem von Li, Deying, Fan, Suohai, Lai, Hong-Jian, Yao, Senmei

Volltext

The disjoint paths problem in quadratic time von Kawarabayashi, Ken-ichi, Kobayashi, Yusuke, Reed, Bruce

Volltext

How does the core sit inside the mantle? von Coja-Oghlan, Amin, Cooley, Oliver, Kang, Mihyun, Skubch, Kathrin

Volltext

Nowhere-zero 3-flows and modulo k-orientations von Lovász, László Miklós, Thomassen, Carsten, Wu, Yezhou, Zhang, Cun-Quan

Volltext

Quickly deciding minor-closed parameters in general graphs von Demaine, Erik D., Hajiaghayi, MohammadTaghi

Volltext

Integrality properties of edge path tree families von Apollonio, Nicola

Volltext

Many T copies in H-free graphs von Alon, Noga, Shikhelman, Clara

Volltext

The Alon-Tarsi number of a planar graph minus a matching von Grytczuk, Jarosław, Zhu, Xuding

Volltext

On a conjecture of Mohar concerning Kempe equivalence of regular graphs von Bonamy, Marthe, Bousquet, Nicolas, Feghali, Carl, Johnson, Matthew

Volltext

The Erdős-Gyárfás function f ( n , 4 , 5 ) = 5 6 n + o ( n ) — So Gyárfás was right von Bennett, Patrick, Cushman, Ryan, Dudek, Andrzej, Prałat, Paweł

Volltext