Accepted papers

You can download all the papers here (20MB zip file): Eurocomb 2015 Proceedings ENDM.

Adam Kabela and Tomas Kaiser.
10-tough chordal graphs are hamiltonian
Alexey Pokrovskiy.
Rainbow matchings and connectedness of coloured graphs
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang and Kathrin Skubch.
How does the core embed into the mantle?
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang and Daniël Paulusma.
Bounding the Clique-Width of H-free Split Graphs
Anna Taranenko.
Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
Asaf Ferber, Gal Kronenberg and Eoin Long.
Packing, Counting and Covering Hamilton cycles in random directed graphs
Ben Barber, Daniela Kühn, Allan Lo and Deryk Osthus.
Edge-decompositions of graphs with high minimum degree
Benny Sudakov and Jan Volec.
Properly colored and rainbow copies of graphs with few cherries
Bojan Mohar and Hehui Wu.
Triangle-free subgraphs with large fractional chromatic number
Carl Feghali, Matthew Johnson and Daniel Paulusma.
Kempe Equivalence of Colourings of Cubic Graphs
Carlos Hoppen, Hanno Lefmann and Knut Odermann.
A rainbow Erdős-Rothschild problem
Chris Godsil, David Roberson, Brendan Rooney, Robert Šámal and Antonios Varvitsiotis.
Graph Cores via Universal Completability
Chun-Hung Liu and Sang-Il Oum.
Partitioning H-minor free graphs into three subgraphs with no large components
Clément Requilé and Juanjo Rué.
Triangles In Random Cubic Planar Graphs
Daniela Kuhn, Deryk Osthus and Amelia Taylor.
On the random greedy F-free hypergraph process
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener and Mate Vizer.
Finding a majority ball with majority answers
Dániel Korándi, Yuval Peled and Benny Sudakov.
A random triadic process
Daniel Kotlar and Ran Ziv.
Decomposition of bi-colored square arrays into balanced diagonals
David Conlon, Asaf Ferber, Rajko Nenadov and Nemanja Skoric.
Almost-spanning universality in random graphs
Dennis Clemens and Mirjana Mikalacki.
Winning fast in fair biased Maker-Breaker games
Dennis Clemens and Yury Person.
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
Eckhard Steffen and Giuseppe Mazzuocollo.
Nowhere-zero 5-flows
Elad Aigner-Horev and Hiep Han.
Arithmetic progressions with a pseudorandom step
Endre Csóka.
Limits of some combinatorial problems
Endre Csóka.
On the graph limit question of Vera T. Sós
Eoin Long.
Large unavoidable subtournaments
Eugenijus Manstavičius and Robertas Petuchovas.
Permutations without long or short cycles
Ewan Davies.
Counting in hypergraphs via regularity inheritance
Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro and Yoshiko Wakabayashi.
Decompositions of Highly Connected Graphs into Paths of Any Given Length
Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro and Yoshiko Wakabayashi.
Path Decompositions of Regular Graphs with Prescribed Girth
Felix Joos and Henning Bruhn.
A stronger bound for the strong chromatic index
François Dross, Mickael Montassier and Alexandre Pinlou.
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
Frederic Maffray.
Even pairs in square-free Berge graphs
Gabor Wiener.
On non-traceable, non-hypotraceable, arachnoid graphs
Gabriel Nivasch and Eran Omri.
Rainbow matchings and algebras of sets
Gabriel Nivasch.
On the zone of a circle in an arrangement of lines
Gašper Fijavž.
Bounded face-width forces K7-minors in orientable surfaces
Gill Barequet and Mira Shalah.
Automatic Proofs for Formulae Enumerating Proper Polycubes
Gill Barequet and Ronnie Barequet.
An improved Upper Bound on the Growth Constant of Polyominoes
Guus Regts.
Regularity lemma’s in a Banach space setting with applications to approximating matrix norms
Hans Bodlaender, Pinar Heggernes and Jan Arne Telle.
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
Henning Bruhn, Laura Gellert and Jacob Günther.
Jacobsthal numbers in generalised Petersen graphs
Huda Chuangpishit, Mahya Ghandehari and Jeannette Janssen.
Uniform Linear Embeddings of Spatial Random Graphs
Ilia Akolzin and Dmitry Shabanov.
Colorings of hypergraphs with large number of colors
Ingo Schiermeyer, Christoph Brause, Premysl Holub, Zdenek Ryjacek, Petr Vrana and Rastislav Krivos-Bellus.
4-colorability of P6-free graphs
Irina Shirgazina.
Equitable colorings of non-uniform simple hypergraphs
Jacob Cooper, Tomas Kaiser, Daniel Kral and Jonathan Noel.
Weak regularity and finitely forcible graph limits
Jaehoon Kim, Daniela Kühn and Deryk Osthus.
Bipartitions of highly connected tournaments
Jakub Kozik and Dmitry Shabanov.
Extremal problems for colorings of simple hypergraphs and applications
Jan Hubička and Jaroslav Nešetřil.
Ramsey classes with forbidden homomorphisms and a closure
Jan van den Heuvel, Patrice Ossona de Mendez, Roman Rabinovich and Sebastian Siebertz.
On the generalised colouring numbers of graphs that exclude a fixed minor
Jaroslav Nesetril and Patrice Ossona De Mendez.
Structural Limits and Approximations of Maps
Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond and Théophile Trunck.
Induced minors and well-quasi-ordering
Jaume Martí-Farré, Mercè Mora and José Luis Ruiz.
Completion and decomposition of hypergraphs into dominating sets of graphs
Jiří Fiala, Jan Hubička and Yangjing Long.
An universality argument for graph homomorphisms
József Balogh, Hong Liu, Maryam Sharifzadeh and Andrew Treglown.
An exact bound on the number of maximal sum-free sets
Juanjo Rué, Oriol Serra and Lluis Vena.
Counting configuration–free sets in groups
Julien Bensmail, Marthe Bonamy and Hervé Hocquard.
Strong edge coloring sparse graphs
Katerina Böhmová, Cristina Dalfó and Clemens Huemer.
The Diameter of Cyclic Kautz Digraphs
Katherine Staden and Andrew Treglown.
On a degree sequence analogue of Pósa’s conjecture
Konstanty Junosza-Szaniawski.
First non-trivial upper bound on circular chromatic number of the plane
Luke Postle.
On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs
Marcia R. Cerioli and Taisa L. Martins.
Structural Results for General Partition, Equistable and Triangle graphs
Martin Balko and Pavel Valtr.
A SAT attack on the Erdős–Szekeres conjecture
Martin Balko, Josef Cibulka, Karel Král and Jan Kynčl.
Ramsey numbers of ordered graphs
Martin Merker.
Decomposing series-parallel graphs into paths of length 3 and triangles
Matthew Jenssen.
The Multicolour Ramsey Number of a Long Odd Cycle
Matthew Johnson, Daniel Paulusma and Erik Jan van Leeuwen.
What Graphs are 2-Dot Product Graphs?
Michael Hebdige and Daniel Kral.
Third case of the Cyclic Coloring Conjecture
Michael Krivelevich, Matthew Kwan and Benny Sudakov.
Cycles and matchings in randomly perturbed digraphs and hypergraphs
Michael Mosshammer, Philipp Sprüssel, Wenjie Fang and Mihyun Kang.
Enumeration of cubic multigraphs on orientable surfaces
Mihyun Kang and Philipp Sprüssel.
Characterisation of symmetries of unlabelled triangulations
Mihyun Kang, Christoph Koch and Tamas Makai.
Bootstrap percolation in random k-uniform hypergraphs
Mikael Hansson.
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
Miquel Àngel Fiol.
The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
Mohammad Mahdian and Ebadollah Mahmoodian.
Sudoku Rectangle Completion
Mykhaylo Tyomkyn and Andrew J. Uzzell.
Strong Turán stability
Ngoc Le, Christoph Brause and Ingo Schiermeyer.
The Maximum Independent Set Problem in Subclasses of Si,j,k-Free Graphs
Nina Kamcev, Michael Krivelevich and Benny Sudakov.
Some Remarks on Rainbow Connectivity
Noga Alon and Clara Shikhelman.
Many T copies in H-free graphs
Noga Alon, Shagnik Das, Roman Glebov and Benny Sudakov.
Comparable pairs in families of sets
Olaf Parczyk and Yury Person.
On spanning structures in random hypergraphs
Oliver Cooley, Mihyun Kang and Christoph Koch.
Evolution of high-order connected components in random hypergraphs
Pavel Dvořák and Tomáš Valla.
On the Computational Complexity and Strategies of Online Ramsey Theory
Paweł Rzążewski, Zbigniew Lonc and Michał Dębski.
Harmonious and achromatic colorings of fragmentable hypergraphs
Peter Allen, Barnaby Roberts and Jozef Skokan.
Ramsey Numbers of Squares of Paths
Peter Allen, Julia Boettcher, Yoshiharu Kohayakawa and Barnaby Roberts.
Triangle Free Subgraphs of Random Graphs
Peter Allen, Julia Böttcher, Julia Ehrenmüller and Anusch Taraz.
Local resilience of spanning subgraphs in sparse random graphs
Peter Allen, Julia Böttcher, Oliver Cooley and Richard Mycroft.
Regular slices for hypergraphs
Peter Allen, Julia Böttcher, Oliver Cooley and Richard Mycroft.
Tight cycles in hypergraphs
Peter Horak, Igor Semaev and Zsolt Tuza.
An Application of Combinatorics in Cryptography
Raúl Falcón.
Classifying partial Latin rectangles
Richard Lang and Maya Stein.
Local colourings and monochromatic partitions in complete bipartite graphs
Richard Lang, Oliver Schaudt and Maya Stein.
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
Ross J. Kang, Viresh Patel and Guus Regts.
On a Ramsey-type problem of Erdős and Pach
Sergio Cabello, Bojan Mohar and Robert Samal.
Drawing a disconnected graph on the torus
Shagnik Das and Tuan Tran.
A simple removal lemma for large nearly-intersecting families
Shagnik Das, Benny Sudakov and Pedro Vieira.
Almost-Fisher families
Shuya Chiba and Nicolas Lichiardopol.
Vertex-disjoint subgraphs with high degree sums
Sigve Hortemo Sæther and Martin Vatshelle.
Hardness of computing width parameters based on branch decompositions over the vertex set
Silvia Messuti, Vojtěch Rödl and Mathias Schacht.
Packing minor closed families of graphs
Stefan Glock, Daniela Kühn and Deryk Osthus.
Optimal path and cycle decompositions of dense quasirandom graphs
Tamon Stephen and Timothy Yusun.
The Circuit Diameter of the Klee-Walkup Polytope
Thomas Krajewski, Iain Moffat and Adrian Tanasa.
An extension of the Bollobas-Riordan polynomial for vertex partitioned ribbon graphs: definition and universality
Tina Janne Schmidt, Cristina Fernandes and Anusch Taraz.
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width
Tomasz Krawczyk and Bartosz Walczak.
Asymmetric coloring games on incomparability graphs
Torsten Mütze and Pascal Su.
Bipartite Kneser graphs are Hamiltonian
Val Pinciu.
Guarding Polyominoes, Polycubes and Polyhypercubes
Winfried Hochstättler.
Towards a Flow-Theory for the Dichromatic Number