Michael Krivelevich

SIAM J. Discret. Math., 2025

Rigid partitions: From high connectivity to random graphs.

[BibT_eX]

[DOI]

Alan Lew

J. Comb. Theory B, 2025

Minors, connectivity, and diameter in randomly perturbed sparse graphs.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Eur. J. Comb., 2025

Colouring random subgraphs.

[BibT_eX]

[DOI]

Boris Bukh

Bhargav Narayanan

Comb. Probab. Comput., 2025

Long Cycles in Percolated Expanders.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Disjoint Connected Dominating Sets in Pseudorandom Graphs.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Reconstructing Random Graphs from Distance Queries.

[BibT_eX]

[DOI]

Maksim Zhukovskii

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs.

[BibT_eX]

[DOI]

Comb., August, 2024

On vertex Ramsey graphs with forbidden subgraphs.

[BibT_eX]

[DOI]

Discret. Math., March, 2024

Expansion in supercritical random subgraphs of expanders and its consequences.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2024

Hamilton completion and the path cover number of sparse random graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Maximum chordal subgraphs of random graphs.

[BibT_eX]

[DOI]

Maksim Zhukovskii

Comb. Probab. Comput., 2024

Percolation on irregular high-dimensional product graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

2023

Cycle lengths in randomly perturbed graphs.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Random Struct. Algorithms, December, 2023

Site percolation on pseudo-random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, September, 2023

Largest subgraph from a hereditary property in a random graph.

[BibT_eX]

[DOI]

Discret. Math., September, 2023

On subgraphs with degrees of prescribed residues in the random graph.

[BibT_eX]

[DOI]

Liam Hardiman

Random Struct. Algorithms, August, 2023

Oriented discrepancy of Hamilton cycles.

[BibT_eX]

[DOI]

J. Graph Theory, August, 2023

Complete minors and average degree: A short proof.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Supercritical site percolation on the hypercube: small components are small.

[BibT_eX]

[DOI]

Comb. Probab. Comput., May, 2023

Robin Thomas (1962-2020).

[BibT_eX]

[DOI]

Bojan Mohar

J. Comb. Theory B, 2023

2022

Component Games on Random Graphs.

[BibT_eX]

[DOI]

Comb., December, 2022

Spanning Trees at the Connectivity Threshold.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Color-biased Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

The largest hole in sparse random graphs.

[BibT_eX]

[DOI]

Stefan Glock

Random Struct. Algorithms, 2022

Cycle lengths in sparse random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

Discrepancies of spanning trees and Hamilton cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Short proofs for long induced paths.

[BibT_eX]

[DOI]

Stefan Glock

Comb. Probab. Comput., 2022

On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

The size-Ramsey number of short subdivisions.

[BibT_eX]

[DOI]

Rajko Nenadov

Random Struct. Algorithms, 2021

Divisible subdivisions.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Large complete minors in random subgraphs.

[BibT_eX]

[DOI]

Joshua Erde

Mihyun Kang

Comb. Probab. Comput., 2021

Cycle Lengths in Expanding Graphs.

[BibT_eX]

[DOI]

Limor Friedman

Comb., 2021

Rolling backwards can move you forward: on embedding problems in sparse expanders.

[BibT_eX]

[DOI]

Rajko Nenadov

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

2020

Asymptotics in percolation on high-girth expanders.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2020

The Kőnig graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Finding a Hamilton cycle fast on average using rotations and extensions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Ron Graham (1935-2020).

[BibT_eX]

[DOI]

Bojan Mohar

J. Comb. Theory B, 2020

Edge-statistics on large graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Very fast construction of bounded-degree spanning graphs via the semi-random graph process.

[BibT_eX]

[DOI]

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

Greedy Maximal Independent Sets via Local Limits.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

Goldberg's conjecture is true for random multigraphs.

[BibT_eX]

[DOI]

Penny Haxell

J. Comb. Theory B, 2019

Long Cycles in Locally Expanding Graphs, with Applications.

[BibT_eX]

[DOI]

Comb., 2019

Optimal shattering of complex networks.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2019

Expanders - how to find them, and what to find in them.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018

Finding and Using Expanders in Locally Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Elegantly Colored Paths and Cycles in Edge Colored Random Graphs.

[BibT_eX]

[DOI]

Lisa Espig

SIAM J. Discret. Math., 2018

The random k-matching-free process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Clique coloring of dense random graphs.

[BibT_eX]

[DOI]

Malgorzata Bednarska-Bzdega

J. Graph Theory, 2018

Proper colouring Painter-Builder game.

[BibT_eX]

[DOI]

Viola Mészáros

Clément Requilé

Discret. Math., 2018

Packing Hamilton Cycles Online.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property.

[BibT_eX]

[DOI]

Chris Dowden

Mihyun Kang

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.

[BibT_eX]

[DOI]

Matthew Kwan

SIAM J. Discret. Math., 2017

Finding paths in sparse random graphs requires many queries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Efficient Winning Strategies in Random-Turn Maker-Breaker Games.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Waiter-Client and Client-Waiter Hamiltonicity games on random graphs.

[BibT_eX]

[DOI]

Wei En Tan

Eur. J. Comb., 2017

Small Subgraphs in the Trace of a Random Walk.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Compatible Hamilton cycles in Dirac graphs.

[BibT_eX]

[DOI]

Comb., 2017

2016

Compatible Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Finding Hamilton cycles in random graphs with few queries.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Editorial.

[BibT_eX]

[DOI]

Bojan Mohar

J. Comb. Theory B, 2016

On saturation games.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Waiter-Client and Client-Waiter planarity, colorability and minor games.

[BibT_eX]

[DOI]

Malgorzata Bednarska-Bzdega

Wei En Tan

Discret. Math., 2016

Manipulative Waiters with Probabilistic Intuition.

[BibT_eX]

[DOI]

Tomasz Luczak

Comb. Probab. Comput., 2016

The Phase Transition in Site Percolation on Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Client-Waiter Games on Complete and Random Graphs.

[BibT_eX]

[DOI]

Oren Dean

Electron. J. Comb., 2016

Random Graphs, Geometry and Asymptotic Structure.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Mathew D. Penrose

Colin J. H. McDiarmid

London Mathematical Society student texts 84, Cambridge University Press, ISBN: 978-1-316-50191-7, 2016

2015

Large Subgraphs without Short Cycles.

[BibT_eX]

[DOI]

Florent Foucaud

Guillem Perarnau

SIAM J. Discret. Math., 2015

Walker-Breaker Games.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Generating random graphs in biased Maker-Breaker games.

[BibT_eX]

[DOI]

Humberto Naves

Random Struct. Algorithms, 2015

Biased games on random boards.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Cycles and matchings in randomly perturbed digraphs and hypergraphs.

[BibT_eX]

[DOI]

Matthew Kwan

Electron. Notes Discret. Math., 2015

Some Remarks on Rainbow Connectivity.

[BibT_eX]

[DOI]

Nina Kamcev

Electron. Notes Discret. Math., 2015

Decomposing Random Graphs into Few Cycles and Edges.

[BibT_eX]

[DOI]

Dániel Korándi

Comb. Probab. Comput., 2015

Random-Player Maker-Breaker games.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Contagious Sets in Expanders.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

On covering expander graphs by hamilton cycles.

[BibT_eX]

[DOI]

Roman Glebov

Random Struct. Algorithms, 2014

Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Packing Tree Factors in Random and Pseudo-random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Smoothed Analysis on Connected Graphs.

[BibT_eX]

[DOI]

Daniel Reichman

Proceedings of the Approximation, 2014

2013

On the Number of Hamilton Cycles in Sparse Random Graphs.

[BibT_eX]

[DOI]

Roman Glebov

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]

Random Struct. Algorithms, 2013

Avoider-Enforcer games played on edge disjoint hypergraphs.

[BibT_eX]

[DOI]

Alon Naor

Discret. Math., 2013

On the Non-Planarity of a Random Subgraph.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

The Biased Odd Cycle Game.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Comparing the strength of query types in property testing: The case of k-colorability.

[BibT_eX]

[DOI]

Comput. Complex., 2013

2012

Optimal Packings of Hamilton Cycles in Sparse Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Creating Small Subgraphs in Achlioptas Processes With Growing Parameter.

[BibT_eX]

[DOI]

Reto Spöhel

SIAM J. Discret. Math., 2012

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Packing hamilton cycles in random and pseudo-random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Variations on cops and robbers.

[BibT_eX]

[DOI]

Po-Shen Loh

J. Graph Theory, 2012

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

[BibT_eX]

[DOI]

J. Graph Theory, 2012

The size Ramsey number of a directed path.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Biased orientation games.

[BibT_eX]

[DOI]

Discret. Math., 2012

Fast Strategies In Maker-Breaker Games Played on Random Boards.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

On the Number of Hamilton Cycles in Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Expanders are universal for the class of all spanning trees.

[BibT_eX]

[DOI]

Daniel Johannsen

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Regular induced subgraphs of a random Graph.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Random Struct. Algorithms, 2011

Ramsey games with giants.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Fast embedding of spanning trees in biased Maker-Breaker games.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Global Maker-Breaker games on sparse graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

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

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

The Number of f-Matchings in Almost Every Tree is a Zero Residue.

[BibT_eX]

[DOI]

Simi Haber

Electron. J. Comb., 2011

Packing tight Hamilton cycles in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Po-Shen Loh

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

Hitting time results for Maker-Breaker games.

[BibT_eX]

[DOI]

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

2010

Resilient Pancyclicity of Random and Pseudorandom Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Embedding Spanning Trees in Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Colin Cooper

SIAM J. Discret. Math., 2010

Offline thresholds for Ramsey-type games on random graphs.

[BibT_eX]

[DOI]

Reto Spöhel

Angelika Steger

Random Struct. Algorithms, 2010

Hamiltonicity thresholds in Achlioptas processes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Why Almost All k-Colorable Graphs Are Easy to Color.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Theory Comput. Syst., 2010

The rainbow connection of a graph is (at most) reciprocal to its minimum degree.

[BibT_eX]

[DOI]

Raphael Yuster

J. Graph Theory, 2010

A note on regular Ramsey graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Hierarchy Theorems for Property Testing.

[BibT_eX]

[DOI]

Proceedings of the Property Testing - Current Research and Surveys, 2010

Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability.

[BibT_eX]

[DOI]

Proceedings of the Property Testing - Current Research and Surveys, 2010

2009

Spanning Directed Trees with Many Leaves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Equitable coloring of random graphs.

[BibT_eX]

[DOI]

Balázs Patkós

Random Struct. Algorithms, 2009

Avoiding small subgraphs in Achlioptas processes.

[BibT_eX]

[DOI]

Po-Shen Loh

Random Struct. Algorithms, 2009

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

[BibT_eX]

[DOI]

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

Playing to retain the advantage.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Vertex percolation on expander graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Random regular graphs of non-constant degree: Concentration of the chromatic number.

[BibT_eX]

[DOI]

Discret. Math., 2009

On the Random Satisfiable Process.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Perfectly Balanced Partitions of Smoothed Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Hamilton cycles in highly connected and expanding graphs.

[BibT_eX]

[DOI]

Comb., 2009

On smoothed k-CNF formulas and the Walksat algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Hierarchy Theorems for Property Testing.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2009

2008

Planarity, Colorability, and Minor Games.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Large Nearly Regular Induced Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Corrigendum: On fractional K-factors of random graphs.

[BibT_eX]

[DOI]

Simi Haber

Random Struct. Algorithms, 2008

The isoperimetric constant of the random graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Winning Fast in Sparse Graph Construction Games.

[BibT_eX]

[DOI]

Ohad N. Feldheim

Comb. Probab. Comput., 2008

Biased Positional Games and Small Hypergraphs with Large Covers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

On Rainbow Trees and Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Comparing the strength of query types in property testing: the case of testing k-colorability.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Small Sample Spaces Cannot Fool Low Degree Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

2007

Approximation algorithms and hardness results for cycle packing problems.

[BibT_eX]

[DOI]

Zeev Nutov

Mohammad R. Salavatipour

Jacques Verstraëte

Raphael Yuster

ACM Trans. Algorithms, 2007

On fractional K-factors of random graphs.

[BibT_eX]

[DOI]

Simi Haber

Random Struct. Algorithms, 2007

Avoider-Enforcer games.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213].

[BibT_eX]

[DOI]

Inf. Comput., 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

On the Chromatic Number of Random Graphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Cliff Smyth

Comb. Probab. Comput., 2007

Embedding nearly-spanning bounded degree trees.

[BibT_eX]

[DOI]

Comb., 2007

Why Almost All k -Colorable Graphs Are Easy.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Proceedings of the STACS 2007, 2007

Parameterized Algorithms for Directed Maximum Leaf Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Better Algorithms and Bounds for Directed Maximum Leaf Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

On smoothed analysis in dense graphs and formulas.

[BibT_eX]

[DOI]

Prasad Tetali

Random Struct. Algorithms, 2006

Coloring complete bipartite graphs from random lists.

[BibT_eX]

[DOI]

Asaf Nachmias

Random Struct. Algorithms, 2006

Almost universal graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

On the asymptotic value of the choice number of complete multi-partite graphs.

[BibT_eX]

[DOI]

Nurit Gazit

J. Graph Theory, 2006

Preface.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

Solving random satisfiable 3CNF formulas in expected polynomial time.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Testing triangle-freeness in general graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Semirandom Models as Benchmarks for Coloring Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006

2005

Testing Reed-Muller codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

The Strong Chromatic Index of Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.

[BibT_eX]

[DOI]

Joel Friedman

Andreas Goerdt

SIAM J. Comput., 2005

On packing Hamilton cycles in ?-regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Discrepancy Games.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

Approximation algorithms for cycle packing problems.

[BibT_eX]

[DOI]

Zeev Nutov

Raphael Yuster

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

On the random 2-stage minimum spanning tree.

[BibT_eX]

[DOI]

Abraham D. Flaxman

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

The emergence of a giant component in random subgraphs of pseudo-random graphs.

[BibT_eX]

[DOI]

Ryan R. Martin

Random Struct. Algorithms, 2004

Adding random edges to dense graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Algorithms with large domination ratio.

[BibT_eX]

[DOI]

Gregory Z. Gutin

J. Algorithms, 2004

Colouring powers of cycles from random lists.

[BibT_eX]

[DOI]

Asaf Nachmias

Eur. J. Comb., 2004

Triangle Factors In Sparse Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Comb., 2004

Bounds on distance distributions in codes of known size.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 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

Generalized hashing and parent-identifying codes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 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

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

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Tight Bounds for Testing Bipartiteness in General Graphs.

[BibT_eX]

[DOI]

Tali Kaufman

Dana Ron

Proceedings of the Approximation, 2003

Testing Low-Degree Polynomials over GF(2(.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

2002

Upper bounds on the rate of LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Testing k-colorability.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.

[BibT_eX]

[DOI]

J. Comb. Optim., 2002

Deciding k-colorability in expected polynomial time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Hamilton cycles in random subgraphs of pseudo-random graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Fractional Planks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

A Sharp Threshold For Network Reliability.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Sparse Graphs Usually Have Exponentially Many Optimal Colorings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

Random regular graphs of high degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Choosability in Random Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the STACS 2001, 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

2000

Sharp thresholds for certain Ramsey properties of random graphs.

[BibT_eX]

[DOI]

Ehud Friedgut

Random Struct. Algorithms, 2000

Long cycles in critical graphs.

[BibT_eX]

[DOI]

Paul D. Seymour

J. Graph Theory, 2000

The Choice Number Of Dense Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Scalable Secure Storage when Half the System Is Faulty.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Two-coloring Random Hypergraphs.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

1999

Coloring Graphs with Sparse Neighborhoods.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

List Coloring of Random and Pseudo-Random Graphs.

[BibT_eX]

[DOI]

Comb., 1999

Regular Languages Are Testable with a Constant Number of Queries.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Efficient Testing of Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 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

A lower bound for irredundant Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 1998

An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 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

Approximate Set Covering in Uniform Hypergraphs.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Constructive Bounds for a Ramsey-Type Problem.

[BibT_eX]

[DOI]

Graphs Comb., 1997

Almost perfect matchings in random uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Triangle Factors in Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

On the Minimal Number of Edges in Color-Critical Graphs.

[BibT_eX]

[DOI]

Comb., 1997

The Concentration of the Chromatic Number of Random Graphs.

[BibT_eX]

[DOI]

Comb., 1997

1996

Perfect fractional matchings in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

On k-saturated graphs with restrictions on the degrees.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

On a Theorem of Lovász on Covers in tau-Partite Hypergraphs.

[BibT_eX]

[DOI]

Ron Aharoni

Ron Holzman

Comb., 1996

1995

Bounding Ramsey Numbers through Large Deviation Inequalities.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

On the Edge Distribution in Triangle-free Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

On a conjecture of Tuza about packing and covering of triangles.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Ks-Free Graphs Without Large Kr-Free Subgraphs.

[BibT_eX]

[DOI]