Sergey Norin

Eur. J. Comb., 2025

2024

Three-Dimensional Graph Products with Unbounded Stack-Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., June, 2024

Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

The burning number conjecture holds asymptotically.

[BibT_eX]

[DOI]

Jérémie Turcotte

J. Comb. Theory B, 2024

The inducibility of oriented stars.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Typical structure of hereditary properties of binary matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Weak diameter coloring of graphs on surfaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Product Structure and Tree-Decompositions.

[BibT_eX]

[DOI]

Chun-Hung Liu

David R. Wood

CoRR, 2024

On an Induced Version of Menger's Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

The Spectrum of Triangle-Free Graphs.

[BibT_eX]

[DOI]

József Balogh

Felix Christian Clemen

Bernard Lidický

Jan Volec

SIAM J. Discret. Math., June, 2023

Clustered colouring of graph classes with bounded treedepth or pathwidth.

[BibT_eX]

[DOI]

Alex Scott

David R. Wood

Comb. Probab. Comput., January, 2023

Connectivity and choosability of graphs with no Kt minor.

[BibT_eX]

[DOI]

Luke Postle

J. Comb. Theory B, 2023

On 2-cycles of graphs.

[BibT_eX]

[DOI]

Robin Thomas

Hein van der Holst

J. Comb. Theory B, 2023

Every graph is eventually Turán-good.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Twin-width of sparse random graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Cops and robbers on P5-free graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Crossing numbers of complete bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Counterexamples to a Conjecture of Harris on Hall Ratio.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Obstructions for partitioning into forests and outerplanar graphs.

[BibT_eX]

[DOI]

Ringi Kim

Sang-il Oum

Discret. Appl. Math., 2022

A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor.

[BibT_eX]

[DOI]

Zi-Xia Song

Comb., 2022

Non-Bipartite K-Common Graphs.

[BibT_eX]

[DOI]

Comb., 2022

Testability and Local Certification of Monotone Properties in Minor-Closed Classes.

[BibT_eX]

[DOI]

Louis Esperet

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Sublinear Separators in Intersection Graphs of Convex Shapes.

[BibT_eX]

[DOI]

Rose McCarty

SIAM J. Discret. Math., 2021

Asymptotic density of graphs excluding disconnected minors.

[BibT_eX]

[DOI]

Rohan Kapadia

Yingjie Qian

J. Comb. Theory B, 2021

Bounding the number of cycles in a graph in terms of its degree sequence.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

The Smallest Matroids with no Large Independent Flat.

[BibT_eX]

[DOI]

Peter Nelson

Electron. J. Comb., 2021

Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?

[BibT_eX]

[DOI]

Ndiamé Ndiaye

Adrian Vetta

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2020

A Lower Bound on the Average Degree Forcing a Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

List coloring with requests.

[BibT_eX]

[DOI]

Luke Postle

J. Graph Theory, 2019

A bound on the inducibility of cycles.

[BibT_eX]

[DOI]

Daniel Král'

Jan Volec

J. Comb. Theory A, 2019

Treewidth of graphs with balanced separations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians.

[BibT_eX]

[DOI]

Adam Bene Watts

Comb., 2019

Clustered Colouring in Minor-Closed Classes.

[BibT_eX]

[DOI]

Comb., 2019

2018

Corrigendum: Orthogonal Tree Decompositions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Orthogonal Tree Decompositions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Turán numbers of extensions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Treewidth of Grid Subsets.

[BibT_eX]

[DOI]

Eli Berger

Comb., 2018

2017

Turán number of generalized triangles.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

The extremal function for disconnected minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

2016

Strongly Sublinear Separators and Polynomial Expansion.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Non-planar extensions of subdivisions of planar graphs.

[BibT_eX]

[DOI]

Robin Thomas

J. Comb. Theory B, 2016

Flag algebras and the stable coefficients of the Jones polynomial.

[BibT_eX]

[DOI]

Stavros Garoufalidis

Thao Vuong

Eur. J. Comb., 2016

Erdős-Szekeres Without Induction.

[BibT_eX]

[DOI]

Yelena Yuditsky

Discret. Comput. Geom., 2016

2015

Excluding a Substar and an Antisubstar.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Sparse halves in dense triangle-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Large Supports are Required for Well-Supported Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

New tools and results in graph minor structure theory.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

A Near-Optimal Mechanism for Impartial Selection.

[BibT_eX]

[DOI]

Nicolas Bousquet

Adrian Vetta

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013

A counterexample to a conjecture of Schwartz.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2013

Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2009

Counting flags in triangle-free digraphs.

[BibT_eX]

[DOI]

Jan Hladký

Daniel Král