Tibor Szabó

Innov. Graph Theory, 2026

2025

New Ramsey Multiplicity Bounds and Search Heuristics.

[BibT_eX]

[DOI]

Found. Comput. Math., October, 2025

Slow graph bootstrap percolation II: Accelerating properties.

[BibT_eX]

[DOI]

David Fabian

Patrick Morris

J. Comb. Theory B, 2025

2024

The automorphism group of projective norm graphs.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., November, 2024

2023

Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.

[BibT_eX]

[DOI]

Penny Haxell

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fully Computer-Assisted Proofs in Extremal Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Oriented Cycles in Digraphs of Large Outdegree.

[BibT_eX]

[DOI]

Lior Gishboliner

Raphael Steiner

Comb., December, 2022

Dichromatic number and forced subdivisions.

[BibT_eX]

[DOI]

Lior Gishboliner

Raphael Steiner

J. Comb. Theory B, 2022

2021

List Ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Ryser's Conjecture for <i>t</i>-intersecting hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Majority Colorings of Sparse Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

On the odd cycle game and connected rules.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Enumerating extensions of mutually orthogonal Latin squares.

[BibT_eX]

[DOI]

Simona Boyadzhiyska

Shagnik Das

Des. Codes Cryptogr., 2020

2019

On the optimality of the uniform random strategy.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

A family of extremal hypergraphs for Ryser's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

2018

Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.

[BibT_eX]

[DOI]

Hiêp Hàn

Vojtech Rödl

SIAM J. Discret. Math., 2018

Extremal hypergraphs for Ryser's Conjecture.

[BibT_eX]

[DOI]

Penny Haxell

Lothar Narins

J. Comb. Theory A, 2018

2017

Sharp Thresholds for Half-Random Games II.

[BibT_eX]

[DOI]

Jonas Groschwitz

Graphs Comb., 2017

Random Strategies are Nearly Optimal for Generalized van der Waerden Games.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Graphs without proper subgraphs of minimum degree 3 and short cycles.

[BibT_eX]

[DOI]

Lothar Narins

Alexey Pokrovskiy

Comb., 2017

2016

Sharp thresholds for half-random games I.

[BibT_eX]

[DOI]

Jonas Groschwitz

Random Struct. Algorithms, 2016

On the minimum degree of minimal Ramsey graphs for multiple colours.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

The Local Lemma Is Asymptotically Tight for SAT.

[BibT_eX]

[DOI]

Heidi Gebauer

J. ACM, 2016

Radiomics-based differentiation of lung disease models generated by polluted air based on X-ray computed tomography data.

[BibT_eX]

[DOI]

BMC Medical Imaging, 2016

Monitoring of Fetal Heart Rate via iPhone.

[BibT_eX]

[DOI]

Proceedings of the eHealth 360°, 2016

2015

On the Concentration of the Domination Number of the Random Graph.

[BibT_eX]

[DOI]

Anita Liebenau

SIAM J. Discret. Math., 2015

2014

On covering expander graphs by hamilton cycles.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

On the rank of higher inclusion matrices.

[BibT_eX]

[DOI]

Codrut Grosu

Yury Person

J. Lond. Math. Soc., 2014

What is Ramsey-equivalent to a clique?

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Conflict-Free Colouring of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

How Many Colors Guarantee a Rainbow Matching?

[BibT_eX]

[DOI]

Benny Sudakov

Electron. J. Comb., 2014

Free Edge Lengths in Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2012

Sharp threshold for the appearance of certain spanning trees in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Bounded transversals in multipartite graphs.

[BibT_eX]

[DOI]

Penny E. Haxell

J. Graph Theory, 2012

2011

Global Maker-Breaker games on sparse graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

The Local Lemma is Tight for SAT.

[BibT_eX]

[DOI]

Heidi Gebauer

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

On the minimum degree of minimal Ramsey graphs.

[BibT_eX]

[DOI]

Philipp Zumstein

Stefanie Zürcher

J. Graph Theory, 2010

2009

A sharp threshold for the Hamilton cycle Maker-Breaker game.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Asymptotic random graph intuition for the biased connectivity game.

[BibT_eX]

[DOI]

Heidi Gebauer

Random Struct. Algorithms, 2009

Fast winning strategies in Maker-Breaker games.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Fast Winning Strategies in Avoider-Enforcer Games.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Avoider-Enforcer: The Rules of the Game.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Vizing's conjecture for chordal graphs.

[BibT_eX]

[DOI]

Ron Aharoni

Discret. Math., 2009

Deciding Relaxed Two-Colourability: A Hardness Jump.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Hamilton cycles in highly connected and expanding graphs.

[BibT_eX]

[DOI]

Comb., 2009

2008

Planarity, Colorability, and Minor Games.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Biased Positional Games and Small Hypergraphs with Large Covers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

How Long Can a Graph be Kept Planar?

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Turán's Theorem in the Hypercube.

[BibT_eX]

[DOI]

Noga Alon

Anja Krech

SIAM J. Discret. Math., 2007

Avoider-Enforcer games.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Relaxed two-coloring of cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Fast winning strategies in positional games.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Bart-Moe games, JumbleG and discrepancy.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

Odd Independent Transversals are Odd.

[BibT_eX]

[DOI]

Penny E. Haxell

Comb. Probab. Comput., 2006

Extremal Problems For Transversals In Graphs With Bounded Degree.

[BibT_eX]

[DOI]

Comb., 2006

Deciding Relaxed Two-Colorability - A Hardness Jump.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Positional games on random graphs.

[BibT_eX]

[DOI]

Milos Stojakovic

Random Struct. Algorithms, 2005

A generalization of Turán's theorem.

[BibT_eX]

[DOI]

Benny Sudakov

Van H. Vu

J. Graph Theory, 2005

Exact <i>k</i>-Wise Intersection Theorems.

[BibT_eX]

[DOI]

Van H. Vu

Graphs Comb., 2005

Discrepancy Games.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

Jumping Doesn't Help in Abstract Cubes.

[BibT_eX]

[DOI]

Ingo Schurr

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes.

[BibT_eX]

[DOI]

Ingo Schurr

Discret. Comput. Geom., 2004

Triangle Factors In Sparse Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Benny Sudakov

Comb., 2004

BCMP Performance Test with TTCN-3 Mobile Node Emulator.

[BibT_eX]

[DOI]

Sarolta Dibuz

Zsolt Torpis

Proceedings of the Testing of Communicating Systems, 16th IFIP International Conerence, 2004

Random Edge Can Be Exponential on Abstract Cubes.

[BibT_eX]

[DOI]

Jirí Matousek

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

2003

Turán's theorem in sparse random graphs.

[BibT_eX]

[DOI]

Van H. Vu

Random Struct. Algorithms, 2003

Bounded size components--partitions and transversals.

[BibT_eX]

[DOI]

Penny E. Haxell

J. Comb. Theory B, 2003

On the spectrum of projective norm-graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

2002

Finding the Sink Takes Some Time.

[BibT_eX]

[DOI]

Ingo Schurr

Proceedings of the Algorithms, 2002

2001

A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

Unique Sink Orientations of Cubes.

[BibT_eX]

[DOI]

Emo Welzl

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

1999

Norm-Graphs: Variations and Applications.

[BibT_eX]

[DOI]

Noga Alon

Lajos Rónyai

J. Comb. Theory B, 1999

On Erdős's Eulerian Trail Game.

[BibT_eX]

[DOI]

Ákos Seress

Graphs Comb., 1999

Intersection Properties of Subsets of Integers.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

1996

On nearly regular co-critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Norm-Graphs and Bipartite Turán Numbers.

[BibT_eX]

[DOI]

János Kollár

Lajos Rónyai

Comb., 1996

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Dense Graphs with Cycle Neighborhoods.

[BibT_eX]

[DOI]

Ákos Seress