Benny Sudakov

J. Comb. Theory B, 2026

Saturation in random hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2026

2025

Matrix discrepancy and the log-rank conjecture.

[BibT_eX]

[DOI]

Math. Program., July, 2025

C4-free subgraphs of high degree with geometric applications.

[BibT_eX]

[DOI]

CoRR, June, 2025

The Cost of Restaking vs. Proof-of-Stake.

[BibT_eX]

[DOI]

Akaki Mamageishvili

CoRR, May, 2025

Sunflowers and Ramsey problems for restricted intersections.

[BibT_eX]

[DOI]

CoRR, April, 2025

Induced Subgraphs of Kr-Free Graphs and the Erdős-Rogers Problem.

[BibT_eX]

[DOI]

Oliver Janzer

Comb., April, 2025

Canonical Ramsey Numbers of Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

Ascending subgraph decomposition.

[BibT_eX]

[DOI]

Kyriakos Katsamaktsis

J. Comb. Theory B, 2025

Kővári-Sós-Turán theorem for hereditary families.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

Economic Censorship Games in Fraud Proofs.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

2024

Effective Bounds for Induced Size-Ramsey Numbers of Cycles.

[BibT_eX]

[DOI]

Domagoj Bradac

Comb., October, 2024

Ramsey Problems for Monotone Paths in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Zhihan Jin

Comb., June, 2024

On Ramsey Size-Linear Graphs and Related Questions.

[BibT_eX]

[DOI]

Domagoj Bradac

SIAM J. Discret. Math., March, 2024

Cycles with many chords.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2024

The minimum degree removal lemma thresholds.

[BibT_eX]

[DOI]

Zhihan Jin

J. Comb. Theory B, 2024

Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2024

A generalization of Bondy's pancyclicity theorem.

[BibT_eX]

[DOI]

David Munhá Correia

Comb. Probab. Comput., 2024

Restricted subgraphs of edge-colored graphs and applications.

[BibT_eX]

[DOI]

CoRR, 2024

Searcher Competition in Block Building.

[BibT_eX]

[DOI]

CoRR, 2024

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Searcher Competition in Block Building.

[BibT_eX]

[DOI]

Akaki Mamageishvili

Christoph Schlegel

Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

2023

Maximal chordal subgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., September, 2023

Complete minors and average degree: A short proof.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Large Independent Sets from Local Considerations.

[BibT_eX]

[DOI]

Comb., June, 2023

Asymptotics of the Hypergraph Bipartite Turán Problem.

[BibT_eX]

[DOI]

Comb., June, 2023

Tight bounds for powers of Hamilton cycles in tournaments.

[BibT_eX]

[DOI]

David Munhá Correia

J. Comb. Theory B, 2023

Threshold Ramsey multiplicity for paths and even cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

Small subgraphs with large average degree.

[BibT_eX]

[DOI]

Oliver Janzer

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

2022

Uniform chain decompositions and applications.

[BibT_eX]

[DOI]

Adam Zsolt Wagner

Random Struct. Algorithms, 2022

Clique minors in graphs with a forbidden subgraph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

An average degree condition for independent transversals.

[BibT_eX]

[DOI]

Stefan Glock

J. Comb. Theory B, 2022

Ramsey number of 1-subdivisions of transitive tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Infinite Sperner's theorem.

[BibT_eX]

[DOI]

Adam Zsolt Wagner

J. Comb. Theory A, 2022

2021

Large Induced Matchings in Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Isomorphic bisections of cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Unavoidable hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Powers of paths in tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Universal and unavoidable graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

The n-queens completion problem.

[BibT_eX]

[DOI]

Stefan Glock

David Munhá Correia

CoRR, 2021

Tournament Quasirandomness from Local Counting.

[BibT_eX]

[DOI]

Comb., 2021

Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs.

[BibT_eX]

[DOI]

Comb., 2021

2020

Asymptotics in percolation on high-girth expanders.

[BibT_eX]

[DOI]

Eyal Lubetzky

Random Struct. Algorithms, July, 2020

Ramsey Goodness of Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Books versus Triangles at the Extremal Density.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

The Kőnig graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Short proofs of some extremal results III.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Completion and deficiency problems.

[BibT_eX]

[DOI]

Rajko Nenadov

Adam Zsolt Wagner

J. Comb. Theory B, 2020

2-factors with k cycles in Hamiltonian graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The oriented size Ramsey number of directed paths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Long directed rainbow cycles and rainbow spanning trees.

[BibT_eX]

[DOI]

Frederik Benzing

Eur. J. Comb., 2020

Orthonormal Representations of H-Free Graphs.

[BibT_eX]

[DOI]

Igor Balla

Discret. Comput. Geom., 2020

Monochromatic trees in random tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

Long Monotone Trails in Random Edge-Labellings of Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

Bounded Degree Spanners of the Hypercube.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Comb., 2020

Number of 1-Factorizations of Regular High-Degree Graphs.

[BibT_eX]

[DOI]

Asaf Ferber

Vishesh Jain

Comb., 2020

Lower Bounds for Max-Cut via Semidefinite Programming.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

The Zero Forcing Number of Graphs.

[BibT_eX]

[DOI]

Thomas Kalinowski

SIAM J. Discret. Math., 2019

Anticoncentration for subgraph statistics.

[BibT_eX]

[DOI]

Tuan Tran

J. Lond. Math. Soc., 2019

3-Color bipartite Ramsey number of cycles and paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Colouring set families without monochromatic k-chains.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Equiangular Subspaces in Euclidean Spaces.

[BibT_eX]

[DOI]

Igor Balla

Discret. Comput. Geom., 2019

An extremal problem for integer sparse recovery.

[BibT_eX]

[DOI]

Sergei Konyagin

CoRR, 2019

Multicolour Bipartite Ramsey Number of Paths.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

An algebraic perspective on integer sparse recovery.

[BibT_eX]

[DOI]

Lenny Fukshansky

Deanna Needell

Appl. Math. Comput., 2019

2018

Two Remarks on Eventown and Oddtown Problems.

[BibT_eX]

[DOI]

Pedro Vieira

SIAM J. Discret. Math., 2018

Intercalates and discrepancy in random Latin squares.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

The random k-matching-free process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Monochromatic cycle covers in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Counting Hamilton cycles in sparse random directed graphs.

[BibT_eX]

[DOI]

Asaf Ferber

Random Struct. Algorithms, 2018

Linearly many rainbow trees in properly edge-coloured complete graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Supersaturation in posets and applications involving the container method.

[BibT_eX]

[DOI]

Jonathan A. Noel

Alex Scott

J. Comb. Theory A, 2018

Non-trivially intersecting multi-part families.

[BibT_eX]

[DOI]

Pedro Vieira

J. Comb. Theory A, 2018

Anagram-Free Colourings of Graphs.

[BibT_eX]

[DOI]

Tomasz Luczak

Comb. Probab. Comput., 2018

Ramsey Goodness of Bounded Degree Trees.

[BibT_eX]

[DOI]

Igor Balla

Comb. Probab. Comput., 2018

Submodular Minimization Under Congruency Constraints.

[BibT_eX]

[DOI]

Martin Nägele

Rico Zenklusen

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Two-Sided, Unbiased Version of Hall's Marriage Theorem.

[BibT_eX]

[DOI]

Eli Shamir

Am. Math. Mon., 2017

Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Saturation in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Finding paths in sparse random graphs requires many queries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Ramsey goodness of paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Domination in 3-tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

Counting and packing Hamilton cycles in dense graphs and oriented graphs.

[BibT_eX]

[DOI]

Asaf Ferber

J. Comb. Theory B, 2017

Ordered Ramsey numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Edge-disjoint rainbow trees in properly coloured complete graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Anagram-free colorings of graphs.

[BibT_eX]

[DOI]

Tomasz Luczak

Electron. Notes Discret. Math., 2017

Monochromatic paths in random tournaments.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Directed Ramsey number for trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Equiangular lines and subspaces in Euclidean spaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Bounded colorings of multipartite graphs and hypergraphs.

[BibT_eX]

[DOI]

Jan Volec

Eur. J. Comb., 2017

The Threshold Probability for Long Cycles.

[BibT_eX]

[DOI]

Roman Glebov

Humberto Naves

Comb. Probab. Comput., 2017

The Extremal Function for Cycles of Length l mod k.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Compatible Hamilton cycles in Dirac graphs.

[BibT_eX]

[DOI]

Comb., 2017

Cycles in triangle-free graphs of large chromatic number.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Comb., 2017

Robustness of graph properties.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2017

2016

Judicious partitions of directed graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Compatible Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Random directed graphs are robustly Hamiltonian.

[BibT_eX]

[DOI]

Dan Hefetz

Angelika Steger

Random Struct. Algorithms, 2016

Finding Hamilton cycles in random graphs with few queries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Short proofs of some extremal results II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Testing Equality in Communication Graphs.

[BibT_eX]

[DOI]

Klim Efremenko

Electron. Colloquium Comput. Complex., 2016

On the densities of cliques and independent sets in graphs.

[BibT_eX]

[DOI]

Comb., 2016

The minimum number of disjoint pairs in set systems and related problems.

[BibT_eX]

[DOI]

Comb., 2016

Ramsey numbers of cubes versus cliques.

[BibT_eX]

[DOI]

Comb., 2016

On the maximum quartet distance between phylogenetic trees.

[BibT_eX]

[DOI]

Humberto Naves

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Discrepancy of random graphs and hypergraphs.

[BibT_eX]

[DOI]

Jie Ma

Humberto Naves

Random Struct. Algorithms, 2015

Long paths and cycles in random subgraphs of graphs with large minimum degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

On the number of monotone sequences.

[BibT_eX]

[DOI]

Wojciech Samotij

J. Comb. Theory B, 2015

Comparable pairs in families of sets.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Properly colored and rainbow copies of graphs with few cherries.

[BibT_eX]

[DOI]

Jan Volec

Electron. Notes Discret. Math., 2015

Cycles and matchings in randomly perturbed digraphs and hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

A random triadic process.

[BibT_eX]

[DOI]

Yuval Peled

Electron. Notes Discret. Math., 2015

Some Remarks on Rainbow Connectivity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Almost-Fisher families.

[BibT_eX]

[DOI]

Pedro Vieira

Electron. Notes Discret. Math., 2015

Ks, t-saturated bipartite graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Decomposing Random Graphs into Few Cycles and Edges.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Maximizing the Number of Independent Sets of a Fixed Size.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Sperner's Theorem and a Problem of Erdős, Katona and Kleitman.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Most Probably Intersecting Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Small complete minors above the extremal edge density.

[BibT_eX]

[DOI]

Asaf Shapira

Comb., 2015

Recent developments in graph Ramsey theory.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

Musical Chairs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Cycle packing.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

On the 3-Local Profiles of Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Turán numbers of bipartite graphs plus an odd cycle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Short Proofs of Some Extremal Results.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

The Minimum Number of Nonnegative Edges in Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

How Many Colors Guarantee a Rainbow Matching?

[BibT_eX]

[DOI]

Roman Glebov

Tibor Szabó

Electron. J. Comb., 2014

2013

Self-Similarity of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

The phase transition in random graphs: A simple proof.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Longest cycles in sparse random digraphs.

[BibT_eX]

[DOI]

Eyal Lubetzky

Random Struct. Algorithms, 2013

Bisections of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

A problem of Erdős on the minimum number of k-cliques.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

All-pairs shortest paths in O(n2) time with high probability.

[BibT_eX]

[DOI]

J. ACM, 2013

Rainbow Turán problem for even cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

An improved bound for the stepping-up lemma.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

On a conjecture of Erdős and Simonovits: Even cycles.

[BibT_eX]

[DOI]

Comb., 2013

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz.

[BibT_eX]

[DOI]

Comb., 2013

Genome reassembly with high-throughput sequencing data.

[BibT_eX]

[DOI]

Nathaniel Parrish

Benjamin Sudakov

Eleazar Eskin

BMC Genom., 2013

Ramsey-type results for semi-algebraic relations.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Dirac's theorem for random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Long cycles in subgraphs of (pseudo)random directed graphs.

[BibT_eX]

[DOI]

Ido Ben-Eliezer

J. Graph Theory, 2012

Bandwidth theorem for random graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Erdős-Hajnal-type theorems in hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

The size Ramsey number of a directed path.

[BibT_eX]

[DOI]

Ido Ben-Eliezer

J. Comb. Theory B, 2012

Nonnegative k-sums, fractional covers, and probability of small deviations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

Hamiltonicity, independence number, and pancyclicity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Biased orientation games.

[BibT_eX]

[DOI]

Ido Ben-Eliezer

Discret. Math., 2012

Getting a Directed Hamilton Cycle Two Times Faster.

[BibT_eX]

[DOI]

Dan Vilenchik

Comb. Probab. Comput., 2012

The Size of a Hypergraph and its Matching Number.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

A counterexample to the Alon-Saks-Seymour conjecture and related problems.

[BibT_eX]

[DOI]

Comb., 2012

On two problems in graph Ramsey theory.

[BibT_eX]

[DOI]

Comb., 2012

Nearly complete graphs decomposable into large induced matchings and their applications.

[BibT_eX]

[DOI]

Ankur Moitra

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

A Bound for the Cops and Robbers Problem.

[BibT_eX]

[DOI]

Alex Scott

SIAM J. Discret. Math., 2011

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs.

[BibT_eX]

[DOI]

Sonny Ben-Shimon

SIAM J. Discret. Math., 2011

Regular induced subgraphs of a random Graph.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Random Struct. Algorithms, 2011

Dependent random choice.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Ramsey games with giants.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Generating all subsets of a finite set with disjoint unions.

[BibT_eX]

[DOI]

David Ellis

J. Comb. Theory A, 2011

Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs.

[BibT_eX]

[DOI]

Sonny Ben-Shimon

Comb. Probab. Comput., 2011

Two extensions of Ramsey's theorem

[BibT_eX]

[DOI]

CoRR, 2011

Oblivious Collaboration.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

Resilient Pancyclicity of Random and Pseudorandom Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Hamiltonicity thresholds in Achlioptas processes.

[BibT_eX]

[DOI]

Eyal Lubetzky

Random Struct. Algorithms, 2010

Pancyclicity of Hamiltonian and highly connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Decompositions into Subgraphs of Small Diameter.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Directed Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Maximum union-free subfamilies

[BibT_eX]

[DOI]

CoRR, 2010

A randomized embedding algorithm for trees.

[BibT_eX]

[DOI]

Jan Vondrák

Comb., 2010

All-Pairs Shortest Paths in O(n2) Time with High Probability.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Avoiding small subgraphs in Achlioptas processes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Ramsey numbers of sparse hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Triangle packings and 1-factors in oriented graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Large induced trees in Kr-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Two remarks on the Burr-Erdos conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On the Random Satisfiable Process.

[BibT_eX]

[DOI]

Dan Vilenchik

Comb. Probab. Comput., 2009

Paths and Stability Number in Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Density theorems for bipartite graphs and related Ramsey-type results.

[BibT_eX]

[DOI]

Comb., 2009

2008

Ramsey-Type Problem for an Almost Monochromatic K4.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Large Nearly Regular Induced Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Local resilience of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

How many random edges make a dense hypergraph non-2-colorable?

[BibT_eX]

[DOI]

Jan Vondrák

Random Struct. Algorithms, 2008

The game chromatic number of random graphs.

[BibT_eX]

[DOI]

Tom Bohman

Alan M. Frieze

Random Struct. Algorithms, 2008

On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Unavoidable patterns.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

On the Strong Chromatic Number of Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

Cycle lengths in sparse graphs.

[BibT_eX]

[DOI]

Comb., 2008

2007

Ramsey Numbers and the Size of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

On graphs with subgraphs having large independence numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Independent transversals in locally sparse graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Induced subgraphs of Ramsey graphs with many distinct degrees.

[BibT_eX]

[DOI]

Boris Bukh

J. Comb. Theory B, 2007

Constrained Ramsey Numbers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Induced Ramsey-type theorems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Small subgraphs of random regular graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Discret. Math., 2007

Rainbow Turán Problems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Note making a K 4-free graph bipartite.

[BibT_eX]

[DOI]

Comb., 2007

Embedding nearly-spanning bounded degree trees.

[BibT_eX]

[DOI]

Comb., 2007

2006

On smoothed analysis in dense graphs and formulas.

[BibT_eX]

[DOI]

Prasad Tetali

Random Struct. Algorithms, 2006

A Ramsey-type result for the hypercube.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Sparse halves in triangle-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

On a restricted cross-intersection problem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.

[BibT_eX]

[DOI]

József Balogh

J. Comb. Theory B, 2006

Preface.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

Bounding the Number of Edges in Permutation Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

H-Free Graphs of Large Minimum Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Additive Approximation for Edge-Deletion Problems (Abstract).

[BibT_eX]

[DOI]

Asaf Shapira

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

The Strong Chromatic Index of Random Graphs.

[BibT_eX]

[DOI]

Alan M. Frieze

SIAM J. Discret. Math., 2005

Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

A generalization of Turán's theorem.

[BibT_eX]

[DOI]

Tibor Szabó

J. Graph Theory, 2005

Disjoint representability of sets and their complements.

[BibT_eX]

[DOI]

József Balogh

J. Comb. Theory B, 2005

A New Lower Bound For A Ramsey-Type Problem.

[BibT_eX]

[DOI]

Comb., 2005

On A Hypergraph Turán Problem Of Frankl.

[BibT_eX]

[DOI]

Comb., 2005

The Turán Number Of The Fano Plane.

[BibT_eX]

[DOI]

Comb., 2005

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Additive Approximation for Edge-Deletion Problems.

[BibT_eX]

[DOI]

Asaf Shapira

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

2004

Packing triangles in a graph and its complement.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

On the number of edges not covered by monochromatic copies of a fixed graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Extremal set systems with restricted k-wise intersections.

[BibT_eX]

[DOI]

Zoltán Füredi

J. Comb. Theory A, 2004

Multicoloured extremal problems.

[BibT_eX]

[DOI]

Béla Bollobás

J. Comb. Theory A, 2004

List Colouring When The Chromatic Number Is Close To the Order Of The Graph.

[BibT_eX]

[DOI]

Bruce A. Reed

Comb., 2004

Triangle Factors In Sparse Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Tibor Szabó

Comb., 2004

On the Value of a Random Minimum Weight Steiner Tree.

[BibT_eX]

[DOI]

Comb., 2004

Multicolour Turán problems.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Covering codes with improved density.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

On the probability of independent sets in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

Sparse pseudo-random graphs are Hamiltonian.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Induced subgraphs of prescribed size.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

A few remarks on Ramsey-Tura'n-type problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Maximum cuts and judicious partitions in graphs without short cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Approximate coloring of uniform hypergraphs.

[BibT_eX]

[DOI]

J. Algorithms, 2003

The Largest Eigenvalue Of Sparse Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

On Ramsey Numbers of Sparse Graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Comb. Probab. Comput., 2003

Local Density In Graphs With Forbidden Subgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

On the asymmetry of random regular graphs and random graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

Random Struct. Algorithms, 2002

Asymptotically the List Colouring Constants Are 1.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Comb. Theory B, 2002

On k-wise set-intersections and k-wise Hamming-distances.

[BibT_eX]

[DOI]

Vince Grolmusz

J. Comb. Theory A, 2002

A Sharp Threshold For Network Reliability.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

A Note on Odd Cycle-Complete Graph Ramsey Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

Learning a Hidden Matching.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

Random regular graphs of high degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Acyclic edge colorings of graphs.

[BibT_eX]

[DOI]

Ayal Zaks

J. Graph Theory, 2001

Nowhere-Zero Flows in Random Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Asymptotically Optimal Tree-Packings in Regular Graphs.

[BibT_eX]

[DOI]

Alexander K. Kelmans

Dhruv Mubayi

Electron. J. Comb., 2001

Approximating coloring and maximum independent sets in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Ram Nathaniel

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Constructing worst case instances for semidefinite programming based approximation algorithms.

[BibT_eX]

[DOI]

Uri Zwick

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Bipartite Subgraphs And The Smallest Eigenvalue.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

1999

Coloring Graphs with Sparse Neighborhoods.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

On Two Segmentation Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1999

List Coloring of Random and Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Comb., 1999

1998

The chromatic numbers of random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Coloring Random Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Note on alternating directed cycles.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Anders Yeo

Discret. Math., 1998

Finding a Large Hidden Clique in a Random Graph.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximate Coloring of Uniform Hypergraphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

A Note on τ-Critical Linear Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

1995

Disjoint Systems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

1993

Disjoint Systems (Extended Abstract).

[BibT_eX]

[DOI]