Accepted Papers

Elad Aigner-Horev and Hiep Han LINEAR QUASI-RANDOMNESS OF SUBSETS OF ABELIAN GROUPS AND HYPERGRAPHS
Elad Aigner-Horev, David Conlon, Hiep Han, Yury Person and Mathias Schacht Quasirandomness in hypergraphs
Immanuel Albrecht On Finding Some New Excluded Minors For Gammoids
Peter Allen, Julia Böttcher, Jan Hladky and Diana Piguet Packing degenerate graphs greedily
Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubička, Miltiadis Karamanlis, Michael Kompatscher, Matěj Konečný and Micheal Pawliuk Completing graphs to metric spaces
Andrei Asinowski, Gill Barequet and Yufei Zheng Enumerating Polyominoes with Fixed Perimeter Defect
Jasine Babu, Manu Basavaraju, L. Sunil Chandran and Mathew Francis On Induced Colourful Paths in Triangle-free Graphs
Behrooz Bagheri Gh., Herbert Fleischner, Cun-Quan Zhang and Zhang Zhang Compatible Cycle Decomposition of bad K_5-minor free graphs
Martin Balko, Jan Kynčl, Stefan Langerman and Alexander Pilz Induced Ramsey-type results and binary predicates for point sets
Igor Balla and Benny Sudakov Equiangular lines and subspaces in Euclidean spaces
Afonso Bandeira, Asaf Ferber and Matthew Kwan Resilience for the littlewood-offord problem
Amir-Hossein Bateni, Thibault Manneville and Vincent Pilaud On quadrangulations and Stokes posets
Stéphane Bessy and Jocelyn Thiebaut Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture
David Bevan, Robert Brignall, Andrew Elvey Price and Jay Pantone Staircases, dominoes, and the growth rate of 1324-avoiders
Vladimir Bondarenko and Andrei Nikolaev Some properties of the skeleton of the pyramidal tours polytope
Marthe Bonamy and Kitty Meeks The Interactive Sum Choice Number of Graphs
Fábio Botler and Alexandre Talon Decomposition of 8-regular graphs into paths of length 4
Julia Böttcher, Richard Montgomery, Olaf Parczyk and Yury Person Embedding spanning bounded degree subgraphs in randomly perturbed graphs
Henning Bruhn and Matthias Heinlein K_4-expansions have the edge-Erdős-Pósa-property
Matija Bucic, Shoham Letzter and Benjamin Sudakov Directed Ramsey number for trees
Matija Bucic, Shoham Letzter and Benny Sudakov Monochromatic paths in random tournaments
Sebastián Bustamante, Hiệp Hàn and Maya Stein Almost partitioning 2-edge-colourings of 3-uniform hypegraphs with two monochromatic tight cycles
Wouter Cames van Batenburg and Ross Kang The Bollob\’as–Eldridge–Catlin conjecture for even girth at least $10$
Pilar Cano, Guillem Perarnau and Oriol Serra Rainbow spanning subgraphs in bounded edge–colorings of graphs with large minimum degree
Jose Capco, Matteo Gallet, Georg Grasegger, Christoph Koutschan, Niels Lubbes and Josef Schicho Computing the number of realizations of a Laman graph
Cesar Ceballos, Arnau Padrol and Camilo Sarmiento v-Tamari lattices via subword complexes
Steven Chaplick and Peter Zeman Combinatorial Problems on $H$-graphs
Herman Chen, Sergey Kitaev, Torsten Mütze and Brian Sun On universal partial words
Shuya Chiba On the difference between hamilton cycles and 2-factors with a prescribed number of cycles
Hojin Choi, O-Joung Kwon, Sang-Il Oum and Paul Wollan Chi-boundedness of graph classes excluding wheel vertex-minors
Maurício Collares, Yoshiharu Kohayakawa, Robert Morris and Guilherme O. Mota On the number of r-transitive orientations of G(n,p)
Gwendal Collet, Elie De Panafieu, Danièle Gardy, Bernhard Gittenberger and Vlady Ravelomanana Threshold functions for small subgraphs: an analytic approach
Oliver Cooley, Penny Haxell, Mihyun Kang and Philipp Sprüssel Homological connectedness of random hypergraphs
Jan Corsten Grid Ramsey problem
Julien Courtiel, Éric Fusy, Mathias Lepoutre and Marni Mishna Bijections for walks ending on an axis, using open arc diagrams
Ewan Davies, Matthew Jenssen, Will Perkins and Barnaby Roberts Tight bounds on the coefficients of partition functions via stability
Rémi de Joannis de Verclos, Ross J. Kang and Lucas Pastor Colouring squares of claw-free graphs
Josefran De Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer and Fabian Schulenburg Loose Hamiltonian cycles forced by large $(k-2)$-degree – sharp version
Michał Dębski, Jarosław Grytczuk, Urszula Pastwa, Barbara Pilat, Joanna Sokół, Michał Tuczyński, Przemysław Wenus and Krzysztof Węsek On avoding $r$-repetitions in $\mathbb{R}^2$
Michelle Delcourt and Luke Postle On Star Decompositions of Random Regular Graphs
Michelle Delcourt and Luke Postle On the List Coloring Version of Reed’s Conjecture
Ajit Diwan, Bodhayan Roy and Subir Ghosh Two Layer Drawings of Bipartite Graphs
Martin Doležal, Jan Hladky, Ping Hu and Diana Piguet First steps in combinatorial optimization on graphons: Matchings
Chris Dowden, Mihyun Kang and Philipp Sprussel The evolution of random graphs on surfaces
Guillaume Ducoffe and David Coudert A simple approach for lower-bounding the distortion in any Hyperbolic embedding
Zdenek Dvorak and Jakub Pekarek Irreducible 4-critical triangle-free toroidal graphs
Tomáš Dvořák, Jirka Fink, Petr Gregor and Tomáš Novotný Towards a problem of Ruskey and Savage on matching extendability
Zdeněk Dvořák, Bojan Mohar and Robert Samal Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows
Beka Ergemlidze, Ervin Gyori, Abhishek Methuku and Nika Salia Maximum number of triangles in a C_5-free graph
Beka Ergemlidze, Ervin Gyori and Abhishek Methuku 3-uniform hypergraphs without linear cycles
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le and Stéphan Thomassé Additive bases and flows in graphs
Victor Falgas-Ravry, Oleg Pikhurko and Jan Volec The codegree threshold of K4-
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter and Veit Wiechert Burling graphs, chromatic number, and orthogonal tree-decompositions
Stefan Felsner, Hendrik Schrezenmaier and Raphael Steiner Pentagon contact representations
Jiří Fiala, Jan Hubička and Yangjing Long Gaps in full homomorphism order
Quentin Fortier, Csaba Király, Zoltán Szigeti and Shin-Ichi Tanigawa On packing spanning arborescences with matroid constraint
Jacob Fox and Fan Wei On the Local Approach to Sidorenko Conjecture
Peter Frankl and Andrey Kupavskii {Families with no matchings of size $s$
Nora Frankl, Andrey Kupavskii and Konrad Swanepoel Embedding graphs in Euclidean space
Shinya Fujita, Ruonan Li and Guanghui Wang Decomposing edge-colored graphs under color degree constraints
Zoltan Furedi and Ida Kantor Kneser ranks of random graphs and minimum difference representations
Archontia Giannopoulou, Stephan Kreutzer and Sebastian Wiederrecht Matching Connectivity: On the Structure of Graphs with Perfect Matchings
Daniel Gonçalves and Mathew Francis Duschnik-Miller dimension of contact systems of d-dimensional boxes
Dániel Grósz, Abhishek Methuku and Casey Tompkins On subgraphs of $C_{2k}$-free graphs
Dániel Grósz, Abhishek Methuku and Casey Tompkins Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs
Andrzej Grzesik, Daniel Kral and Laszlo Miklos Lovasz Extremal graph theory and finite forcibility
Vladimir Gusev, Raphaël Jungers and Elena Pribavkina Generalized primitivity of labeled digraphs
Ervin Gyori and Balazs Keszegh On the number of edge-disjoint triangles in K4-free graphs
Jie Han, Allan Lo and Nicolás Sanhueza-Matamala Covering and tiling hypergraphs with tight cycles
Mikael Hansson and Axel Hultman A word property for twisted involutions in Coxeter groups
Ishay Haviv and Dan Levy Symmetric Complete Sum-free Sets in Cyclic Groups
Dan Hefetz and Mykhaylo Tyomkyn On the inducibility of cycles
Winfried Hochstättler and Michael Wilhelmi Sticky matroids and Kantor’s Conjecture
Carlos Hoppen, Richard Lang, Hanno Lefmann, Yoshiharu Kohayakawa and Henrique Stagni Estimating the distance to a hereditary graph property
Carlos Hoppen, Roberto Freitas Parente and Cristiane Sato Packing arborescences in random digraphs
Jan Hubička and Jaroslav Nešetřil Ramsey theorem for designs
Clemens Huemer, Alexander Pilz, Carlos Seara and Rodrigo I. Silveira Characteristic polynomials of production matrices for geometric graphs
Radek Hušek and Robert Šámal Homomorphisms of Cayley graphs and Cycle Double Covers
Oscar Iglesias-Valiño and Francisco Santos Classification of empty lattice 4-simplices
Ross J. Kang and François Pirot Distance colouring without one cycle length
Wanchote Jiamjitrak and Erik Jan van Leeuwen Co-Bipartite Neighborhood Edge Elimination Orderings
Nina Kamcev, Tomasz Łuczak and Benny Sudakov Anagram-free colorings of graphs
Mihyun Kang, Michael Mosshammer and Philipp Sprüssel Evolution of the giant component in graphs on orientable surfaces
Mihyun Kang, Tamas Makai and Oleg Pikhurko Supersaturation Problem for the Bowtie
Manuel Kauers and Ronghua Wang Lattice Walks in the Octant with Infinite Associated Groups
Konrad Kazimierz Dabrowski and Daniel Paulusma Contracting Bipartite Graphs to Paths and Cycles
Tom Kelly and Luke Postle Toward a Local Epsilon Version of Reeds Conjecture
Jaehoon Kim, Hong Liu, Maryam Sharifzadeh and Katherine Staden Proof of Koml\’os’s conjecture on Hamiltonian subsets
Tamás Király and Zsuzsa Mészáros-Karkus Finding strongly popular b-matchings in bipartite graphs
Tereza Klimošová and Stéphan Thomassé Decomposing graphs into paths and trees
Tereza Klimošová, Diana Piguet and Václav Rozhoň A skew version of the Loebl-Komlós-Sós conjecture
Yoshiharu Kohayakawa, Guilherme O. Mota and Mathias Schacht Monochromatic trees in random graphs
Matjaz Konvalinka A bijective proof of the hook-length formula for skew shapes
Dániel Korándi, Gábor Tardos, István Tomon and Craig Weidert On the Turán number of ordered forests
Christopher Kusch, Juanjo Rué, Christoph Spiegel and Tibor Szabó Random Strategies are Nearly Optimal for Generalized van der Waerden Games
Tien-Nam Le, Ararat Harutyunyan, Stephan Thomasse and Alantha Newman Coloring dense digraphs
Vadim Levit and Eugen Mandrescu W2-graphs and shedding vertices
Noam Lifshitz and Nathan Keller The Junta Method in Extremal Hypergraph Theory and Chvátal’s Conjecture
Bart Litjens, Andrew Goodall, Guus Regts and Lluís Vena A Tutte polynomial for non-orientable maps
Hong Liu, Oleg Pikhurko and Katherine Staden The minimum number of triangles in graphs of given order and size
Joshua Lockhart, Otfried Guehne and Simone Severini Combinatorial entanglement
Zoltán Lóránt Nagy Generalizing Erdős, Moon and Moser’s result — The number of $k$-dominating independent sets
Vadim Lozin and Victor Zamaraev The structure and the number of $P_7$-free bipartite graphs
Borut Lužar, Martina Mockovčiaková and Roman Soták On a star chromatic index of subcubic graphs
Eugenijus Manstavicius When do combinatorial structures obey the Poisson-Dirichlet law?
Tilen Marc and Kolja Knauer On tope graphs of complexes of oriented matroids
Alina Mayorova and Ekaterina Vassilieva On the structure constants of the descent algebra of the hyperoctahedral group
Tamás Mészáros and Lajos Rónyai Standard monomials and extremal vector systems
Mirjana Mikalački and Miloš Stojaković Winning fast in biased Maker-Breaker games
Malte Milatz Directed Random Walks on Polytopes with Few Facets
Natasha Morrison and Jonathan Noel Extremal Bounds for Bootstrap Percolation in the Hypercube
Henri Mühle Two Posets of Noncrossing Partitions (Extended Abstract)
Ljuben Mutafchiev An Asymptotic Scheme for Analysis of Expectations of Plane Partition Statistics
Torsten Mütze, Christoph Standke and Veit Wiechert A minimum-change version of the Chung-Feller theorem for Dyck paths
Tomoki Nakamigawa and Tadashi Sakuma The Expansion of a Chord Diagram and the Tutte Polynomial (Extended Abstract)
Diego Nicodemos and Matej Stehlik Odd cycles in cubic plane graphs]{Packing and covering odd cycles in cubic plane graphs with small faces
Marc Noy, Clément Requilé and Juanjo Rué Enumeration of labeled 4-regular planar graphs
Seongmin Ok and Thomas Perrett Density of Real Zeros of the Tutte Polynomial
Lucas Oliveira Contiero, Carlos Hoppen, Hanno Lefmann and Knut Odermann Stability of extremal hypergraphs with applications to an edge-coloring problem
Liudmila Ostroumova Prokhorenkova, Pawel Pralat and Andrei Raigorodskii Modularity in several random graph models
Lale Özkahya and Yury Person Minimum rainbow H-decompositions of graphs
Boram Park and Seonjeong Park Shellable posets arisen from the even subgraphs of a multigraph
Viresh Patel and Guus Regts Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Viresh Patel, Allan Lo, Jozef Skokan and John Talbot Decomposing Tournaments into Paths
Diana Piguet and Maria Saumell A median-type condition for graph tiling
Vincent Pilaud and Viviane Pons Permutrees
Alexey Pokrovskiy and Benny Sudakov Edge-disjoint rainbow trees in properly complete graphs
Alexandr Polyanskii Pairwise intersecting homothets of a convex body
Guus Regts and Bart Sevenster Graph parameters from invariants of the orthosymplectic group
Israel Rocha Spectral Bisection with Two Eigenvectors
Aharoni Ron, Eli Berger, Daniel Kotlar and Ran Ziv Fair representation in dimatroids
Katarzyna Rybarczyk Hamilton cycles in the line graph of a random graph – extended abstract
Arseniy Sagdeev On a Frankl-Rodl theorem and its geometric corollaries
Dmitry Shabanov, Dmitry Kravtsov and Nikolay Krokhmal Panchromatic 3-coloring of a random hypergraph
Dmitry Shabanov and Margarita Akhmejanova Colorings of b-simple hypergraphs
William T. Trotter and Bartosz Walczak Boolean dimension and local dimension
Mikhail Tikhomirov On complexity of multidistance graph recognition in R^1
Istvan Tomon, Vytautas Gruslys and Imre Leader Tiling the Boolean lattice with copies of a poset
Mykhaylo Tyomkyn Lagrangians of hypergraphs: The Frankl-F\”uredi conjecture holds almost everywhere
Rika Yatchak Automated Positive Part Extraction for Lattice Path Generating Functions in the Octant
Octavio Zapata, Anuj Dawar and Simone Severini Pebble Games and Cospectral Graphs