European Conference on Combinatorics, Graph Theory and Applications

Andrés Aranda, Samuel Braunfeld, David Chodounský, Jan Hubička, Matěj Konečný, Jarsolav Nešetřil, Andy Zucker
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-008

PDF

009: Cycles of every length and orientation in randomly perturbed digraphs

66–73

Igor Araujo, József Balogh, Robert Krueger, Simón Piga, Andrew Treglown
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-009

PDF

010: Tiling problems in edge-ordered graphs

74–81

Igor Araujo, Simón Piga, Andrew Treglown, Zimu Xiang
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-010

PDF

011: Graphs without a rainbow path of length 3

82–87

Sebastian Babiński, Andrzej Grzesik
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-011

PDF

012: Directed graphs without rainbow triangles

88–93

Sebastian Babiński, Andrzej Grzesik, Magdalena Prorok
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-012

PDF

013: On ordered Ramsey numbers of matchings versus triangles

94–100

Martin Balko, Marian Poljak
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-013

PDF

014: On the sizes of t-intersecting k-chain-free families

101–106

József Balogh, William Linz, Balazs Patkos
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-014

PDF

015: Isoperimetric stability in lattices

107–113

Ben Barber, Joshua Erde, Peter Keevash, Alexander Roberts
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-015

PDF

016: Nonrepetitive colorings of R^d

114–119

Kathleen Barsse, Daniel Gonçalves, Matthieu Rosenfeld
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-016

PDF

017: Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron

120–126

Paul Bastide, Carla Groenland, Hugo Jacob, Tom Johnston
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-017

PDF

018: Chromatic number of intersection graphs of segments with two slopes

127–133

Sudatta Bhattacharya, Zdenek Dvorak, Fariba Noorizadeh
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-018

PDF

019: Big Ramsey degrees in the metric setting

134–141

Tristan Bice, Jan Hubička, Matěj Konečný, Noé de Rancourt
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-019

PDF

020: On a recolouring version of Hadwiger’s conjecture

142–148

Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-020

PDF

021: The Localization game on locally finite trees

149–155

Anthony Bonato, Florian Lehner, Trent Marbach, Jd Nir
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-021

PDF

022: Twin-width and permutations

156–162

Édouard Bonnet, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, Stephan Thomassé
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-022

PDF

023: Independent dominating sets in planar triangulations

163–168

Fábio Botler, Cristina Fernandes, Juan Gutiérrez
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023

PDF

024: Biclique immersions in graphs with independence number 2

169–177

Fábio Botler, Andrea Jiménez, Carla N. Lintzmayer, Adrián Pastine, Daniel A. Quiroz, Maycon Sambinelli
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-024

PDF

025: A resolution of the Kohayakawa--Kreuter conjecture for the majority of cases

178–185

Candida Bowtell, Robert Hancock, Joseph Hyde
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-025

PDF

026: Tight path, what is it (Ramsey-)good for? Absolutely (almost) nothing!

186–192

Simona Boyadzhiyska, Allan Lo
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-026

PDF

027: Effective bounds for induced size-Ramsey numbers of cycles

193–200

Domagoj Bradac, Nemanja Draganic, Benny Sudakov
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-027

PDF

028: Single-conflict colorings of degenerate graphs

201–209

Peter Bradshaw, Tomáš Masařík
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-028

PDF

029: Monadic NIP in monotone classes of relational structures

210–215

Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-029

PDF

030: Decomposition horizons: from graph sparsity to model-theoretic dividing lines

216–222

Sam Braunfeld, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-030

PDF

031: Countable ultrahomogeneous 2-colored graphs consisting of disjoint unions of cliques

223–230

Sofia Brenner, Irene Heinrich
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-031

PDF

032: Raising the roof on the threshold for Szemerédi‘s theorem with random differences

231–237

Jop Briët, Davi Castro-Silva
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-032

PDF

033: Random restrictions of high-rank tensors and polynomial maps

238–244

Jop Briët, Davi Castro-Silva
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-033

PDF

034: Strict Erdős-Ko-Rado for simplicial complexes

245–253

Denys Bulavka, Russ Woodroofe
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-034

PDF

035: Exact enumeration of graphs and bipartite graphs with degree constraints

254–262

Emma Caizergues, Elie de Panafieu
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-035

PDF

036: A precise condition for independent transversals in bipartite covers

263–269

Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-036

PDF

037: Chordal graphs with bounded tree-width

270–276

Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-037

PDF

038: A compactification of the set of sequences of positive real numbers with applications to limits of graphs

277–282

David Chodounsky, Lluis Vena
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-038

PDF

039: A direct bijection between two-stack sortable permutations and fighting fish

283–289

Lapo Cioni, Luca Ferrari, Corentin Henriet
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-039

PDF

040: Counting tournament score sequences

290–297

Anders Claesson, Mark Dukes, Atli Fannar Franklín, Sigurður Örn Stefánsson
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-040

PDF

041: The k-XORSAT threshold revisited

298–304

Amin Coja-Oghlan, Mihyun Kang, Lena Krieg, Maurice Rolvien
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-041

PDF

042: Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄

305–313

Linda Cook, Tomáš Masařík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-042

PDF

043: Higher degree Erdős distinct evaluations problem

314–319

Simone Costa, Stefano Della Fiore, Andrea Ferraguti
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-043

PDF

044: Monochromatic configurations on a circle

320–327

Gábor Damásdi, Nora Frankl, Janos Pach, Dömötör Pálvölgyi
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-044

PDF

045: Beyond the Erdős–Sós conjecture

328–335

Akbar Davoodi, Diana Piguet, Hanka Řada, Nicolás Sanhueza-Matamala
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-045

PDF

046: Dispersion on the Complete Graph

336–342

Umberto De Ambroggio, Tamas Makai, Konstantinos Panagiotou
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-046

PDF

047: The root cluster after percolation on preferential attachment trees

343–348

Colin Desmarais, Cecilia Holmgren, Stephan Wagner
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-047

PDF

048: Cycles through two edges in signed graphs

349–354

Matt DeVos, Kathryn Nurse
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-048

PDF

049: Powers of planar graphs, product structure, and blocking partitions

355–361

Marc Distel, Robert Hickingbotham, Michał T. Seweryn, David R. Wood
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-049

PDF

050: When is Cartesian product a Cayley graph?

362–367

Edward Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-050

PDF

051: A generalization of Bondy’s pancyclicity theorem

368–372

Nemanja Draganić, David Munha Correia, Benny Sudakov
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-051

PDF

052: Chvátal-Erdős condition for pancyclicity

373–379

Nemanja Draganić, David Munhá Correia, Benny Sudakov
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-052

PDF

053: Tower gaps in multicolour Ramsey numbers

380–385

Quentin Dubroff, António Girão, Eoin Hurley, Corrine Yap
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-053

PDF

054: On the minimum number of inversions to make a digraph k-(arc-)strong

386–392

Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-054

PDF

055: Precoloring extension in planar near-Eulerian-triangulations

393–400

Zdeněk Dvořák, Benjamin Moore, Michaela Seifrtová, Robert Šámal
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-055

PDF

056: Maximum genus orientable embeddings from circuit decompositions of dense eulerian graphs and digraphs

401–406

M. N. Ellingham, Joanna Ellis-Monaghan
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-056

PDF

057: Tangled Paths: A Random Graph Model from Mallows Permutations

407–415

Jessica Enright, Kitty Meeks, William Pettersson, John Sylvester
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-057

PDF

058: Cop number of random k-uniform hypergraphs

416–424

Joshua Erde, Mihyun Kang, Florian Lehner, Bojan Mohar, Dominik Schmid
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-058

PDF

059: The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

425–432

Louis Esperet, Ugo Giocanti, Clément Legrand-Duchesne
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-059

PDF

060: Sharp threshold for embedding balanced spanning trees in random geometric graphs

433–440

Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-060

PDF

061: Odd-Sunflowers

441–449

Peter Frankl, Janos Pach, Dömötör Pálvölgyi
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-061

PDF

062: Upper bounds on Ramsey numbers for vector spaces over finite fields

450–456

Bryce Frederickson, Liana Yepremyan
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-062

PDF

063: A general bound for the induced poset saturation problem

457–462

Andrea Freschi, Simon Piga, Maryam Sharifzadeh, Andrew Treglown
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-063

PDF

064: Extremal number of graphs from geometric shapes

463–470

Jun Gao, Oliver Janzer, Hong Liu, Zixiang Xu
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-064

PDF

065: The dimension of the feasible region of pattern densities

471–477

Frederik Garbe, Daniel Kral, Alexandru Malekshahian, Raul Penaguiao
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-065

PDF

066: On the structure and values of betweenness centrality in dense betweenness-uniform graphs

478–484

Babak Ghanbari, David Hartman, Vít Jelínek, Aneta Pokorná, Robert Šámal, Pavel Valtr
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-066

PDF

067: The Minimum Degree Removal Lemma Thresholds

485–490

Lior Gishboliner, Benny Sudakov, Zhihan Jin
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-067

PDF

068: Hamilton cycles in pseudorandom graphs

491–496

Stefan Glock, David Munha Correia, Benny Sudakov
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-068

PDF

069: Random perfect matchings in regular graphs

497–502

Bertille Granet, Felix Joos
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-069

PDF

070: Forcing Generalized Quasirandom Graphs Efficiently

503–510

Andrzej Grzesik, Daniel Kráľ, Oleg Pikhurko
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-070

PDF

071: Refined list version of Hadwiger’s Conjecture

511–517

Yangyan Gu, Yiting Jiang, David Wood, Xuding Zhu
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-071

PDF

072: A general approach to transversal versions of Dirac-type theorems

518–525

Pranshu Gupta, Fabian Hamann, Alp Müyesser, Olaf Parczyk, Amedeo Sgueglia
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-072

PDF

073: The maximum number of copies of an even cycle in a planar graph

526–531

Ervin Győri, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Xiutao Zhu
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-073

PDF

074: 3-uniform linear hypergraphs without a long Berge path

532–538

Ervin Győri, Nika Salia
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-074

PDF

075: Rooting algebraic vertices of convergent sequences

539–544

David Hartman, Tomáš Hons, Jaroslav Nešetřil
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-075

PDF

076: Colouring complete multipartite and Kneser-type digraphs

545–551

Ararat Harutyunyan, Gil Puig i Surroca
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-076

PDF

077: The hitting time of clique factors

552–560

Annika Heckel, Marc Kaufmann, Noela Müller, Matija Pasch
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-077

PDF

078: Roudneff‘s Conjecture in Dimension 4

561–567

Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano, Manfred Scheucher
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-078

PDF

079: Locality in sumsets

568–578

Peter van Hintum, Peter Keevash
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-079

PDF

080: Fractionally Isomorphic Graphs and Graphons

579–586

Jan Hladký, Eng Keat Hng
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-080

PDF

081: Permutation flip processes

587–594

Jan Hladký, Hanka Řada
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-081

PDF

082: Twin-width of Planar Graphs; a Short Proof

595–600

Petr Hlineny
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-082

PDF

083: Stack and Queue Numbers of Graphs Revisited

601–606

Petr Hlineny, Adam Straka
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-083

PDF

084: Crux, space constraints and subdivisions

607–614

Seonghyuk Im, Jaehoon Kim, Younjin Kim, Hong Liu
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-084

PDF

085: Cops and Robber on Hyperbolic Manifolds

615–622

Vesna Iršič, Bojan Mohar, Alexandra Wesolek
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-085

PDF

086: How connectivity affects the extremal number of trees

623–631

Suyun Jiang, Hong Liu, Nika Salia
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-086

PDF

087: Semi-algebraic and semi-linear Ramsey numbers

632–638

Zhihan Jin, István Tomon
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-087

PDF

088: Perfect-matching covers of cubic graphs with colouring defect 3

639–646

Ján Karabáš, Edita Macajova, Roman Nedela, Martin Skoviera
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-088

PDF

089: High-rank subtensors of high-rank tensors

647–652

Thomas Karam
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-089

PDF

090: Rainbow spanning trees in uniformly coloured perturbed graphs

653–658

Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-090

PDF

091: (Random) Trees of Intermediate Volume Growth

659–668

George Kontogeorgiou, Martin Winter
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-091

PDF

092: Finding pairwise disjoint vector pairs in F₂ⁿ with a prescribed sequence of differences

669–674

Benedek Kovács
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-092

PDF

093: Avoiding intersections of given size in finite affine spaces AG(n,2)

675–680

Benedek Kovács, Zoltán Lóránt Nagy
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-093

PDF

094: Graph covers and generalized snarks

681–687

Jan Kratochvil, Roman Nedela
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-094

PDF

095: On edge-ordered graphs with linear extremal functions

688–694

Gaurav Kucheriya, Gábor Tardos
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-095

PDF

096: A polynomial removal lemma for posets

695–701

Gabor Kun, Panna Timea Fekete
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-096

PDF

097: Tiling Dense Hypergraphs

702–707

Richard Lang
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-097

PDF

098: On Perfect Subdivision Tilings

708–716

Hyunwoo Lee
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-098

PDF

099: Cycle Partition of Dense Regular Digraphs and Oriented Graphs

717–724

Allan Lo, Viresh Patel, Mehmet Akif Yildiz
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-099

PDF

100: Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles

725–730

Allan Lo, Vincent Pfenninger
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-100

PDF

101: Kneser graphs are Hamiltonian

731–739

Arturo Merino, Torsten Mütze, - Namrata
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-101

PDF

102: Vizing‘s edge-recoloring conjecture holds.

740–747

Jonathan Narboni
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-102

PDF

103: Product-free sets in the free group

748–753

Miquel Ortega, Juanjo Rué, Oriol Serra
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-103

PDF

104: Minimum vertex degree conditions for loose spanning trees in 3-graphs

754–759

Yanitsa Pehova, Kalina Petrova
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-104

PDF

105: Strengthening the Directed Brooks‘ Theorem for oriented graphs and consequences on digraph redicolouring.

760–765

Lucas Picasarri-Arrieta
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-105

PDF

106: On asymptotic confirmation of the Faudree-Lehel Conjecture on the irregularity strength of graphs

766–773

Jakub Przybyło, Fan Wei
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-106

PDF

107: On Hypergraph Supports.

774–783

Rajiv Raman, Karamjeet Singh
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-107

PDF

108: The Rado Multiplicity Problem in Vector Spaces over Finite Fields

784–789

Juanjo Rué, Christoph Spiegel
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-108

PDF

109: Unified study of the phase transition for block-weighted random planar maps

790–798

Zéphyr Salvy
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-109

PDF

110: The Turán Number of Surfaces

799–805

Maya Sankar
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-110

PDF

111: On universal singular exponents in equations with one catalytic parameter of order one

806–811

Gilles Schaeffer
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-111

PDF

112: A new approach for the Brown-Erdős-Sós problem

812–818

Asaf Shapira, Mykhaylo Tyomkyn
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-112

PDF

113: Semidegree, edge density and antidirected subgraphs

819–825

Maya Stein, Camila Zárate-Guerén
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-113

PDF

114: The structure of Sidon set systems

826–831

Maximilian Wötzel
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-114

PDF

115: Minimum non-chromatic-λ-choosable graphs

832–838

Jialu Zhu, Xuding Zhu
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-115

PDF

European Conference on Combinatorics, Graph Theory and Applications

EUROCOMB'23

Prague, Czech RepublicAugust 28 - September 1, 2023

EUROCOMB’23

Prague, Czech Republic
August 28 - September 1, 2023