| Publication | Date of Publication | Type |
|---|
| On the Turán number of the hypercube | 2024-03-19 | Paper |
| The minimum degree removal lemma thresholds | 2024-03-14 | Paper |
| On Ramsey Size-Linear Graphs and Related Questions | 2024-01-23 | Paper |
| Complete minors and average degree: A short proof | 2023-10-12 | Paper |
| Uniform chain decompositions and applications | 2023-10-12 | Paper |
| Clique minors in graphs with a forbidden subgraph | 2023-10-12 | Paper |
| Asymptotics of the hypergraph bipartite Turán problem | 2023-10-04 | Paper |
| Large independent sets from local considerations | 2023-10-04 | Paper |
| The intersection spectrum of 3‐chromatic intersecting hypergraphs | 2023-09-20 | Paper |
| New results for MaxCut in H$H$‐free graphs | 2023-08-23 | Paper |
| The Turán number of the grid | 2023-08-23 | Paper |
| Short Proofs of Rainbow Matchings Results | 2023-08-15 | Paper |
| Resolution of the Erdős–Sauer problem on regular subgraphs | 2023-08-10 | Paper |
| Which graphs can be counted in \(C_4\)-free graphs? | 2023-04-05 | Paper |
| Powers of paths in tournaments | 2023-03-30 | Paper |
| Universal and unavoidable graphs | 2023-03-30 | Paper |
| The regularity method for graphs with few 4‐cycles | 2023-02-10 | Paper |
| Turán numbers of sunflowers | 2023-01-10 | Paper |
| Counting H-free orientations of graphs | 2022-12-20 | Paper |
| Threshold Ramsey multiplicity for odd cycles | 2022-11-29 | Paper |
| Tight bounds for powers of Hamilton cycles in tournaments | 2022-11-28 | Paper |
| Ramsey properties of algebraic graphs and hypergraphs | 2022-10-31 | Paper |
| Lower bounds for max-cut via semidefinite programming | 2022-10-13 | Paper |
| Threshold Ramsey multiplicity for paths and even cycles | 2022-10-07 | Paper |
| Ramsey number of 1-subdivisions of transitive tournaments | 2022-09-23 | Paper |
| Cycles of many lengths in Hamiltonian graphs | 2022-09-06 | Paper |
| The \(n\)-queens completion problem | 2022-07-22 | Paper |
| The Extremal Number of Tight Cycles | 2022-07-13 | Paper |
| On the densities of cliques and independent sets in graphs | 2022-06-29 | Paper |
| \(C_4\)-free subgraphs with large average degree | 2022-04-25 | Paper |
| New bounds for Ryser’s conjecture and related problems | 2022-04-22 | Paper |
| An average degree condition for independent transversals | 2022-03-03 | Paper |
| Infinite Sperner's theorem | 2022-01-20 | Paper |
| A proof of Ringel's conjecture | 2021-10-04 | Paper |
| Isomorphic bisections of cubic graphs | 2021-09-16 | Paper |
| Proof of the Brown–Erdős–Sós conjecture in groups | 2021-09-14 | Paper |
| Tight Ramsey bounds for multiple copies of a graph | 2021-08-26 | Paper |
| Covering graphs by monochromatic trees and Helly-type results for hypergraphs | 2021-08-03 | Paper |
| Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming | 2021-07-23 | Paper |
| Acyclic subgraphs of tournaments with high chromatic number | 2021-07-02 | Paper |
| Tournament quasirandomness from local counting | 2021-06-29 | Paper |
| Monochromatic trees in random tournaments | 2021-06-15 | Paper |
| Flattening rank and its combinatorial applications | 2021-06-11 | Paper |
| Large cliques and independent sets all over the place | 2021-06-10 | Paper |
| Which graphs can be counted in $C_4$-free graphs? | 2021-06-06 | Paper |
| Small doubling, atomic structure and $\ell$-divisible set families | 2021-03-30 | Paper |
| Large Induced Matchings in Random Graphs | 2021-03-17 | Paper |
| A remark on Hamilton cycles with few colors | 2021-03-12 | Paper |
| Halfway to Rota’s Basis Conjecture | 2021-03-11 | Paper |
| Long directed paths in Eulerian digraphs | 2021-01-27 | Paper |
| Number of 1-factorizations of regular high-degree graphs | 2021-01-25 | Paper |
| Short proofs of some extremal results III | 2021-01-05 | Paper |
| The Kőnig graph process | 2021-01-05 | Paper |
| Embedding rainbow trees with applications to graph labelling and decomposition | 2020-12-17 | Paper |
| Ramsey Goodness of Cycles | 2020-10-27 | Paper |
| Asymptotics in percolation on high‐girth expanders | 2020-10-26 | Paper |
| Orthonormal representations of \(H\)-free graphs | 2020-10-23 | Paper |
| A Note on Powers of Paths in Tournaments | 2020-10-15 | Paper |
| Completion and deficiency problems | 2020-09-24 | Paper |
| Bounded degree spanners of the hypercube | 2020-07-29 | Paper |
| 3‐Color bipartite Ramsey number of cycles and paths | 2020-07-17 | Paper |
| 2-factors with \(k\) cycles in Hamiltonian graphs | 2020-07-07 | Paper |
| Long directed rainbow cycles and rainbow spanning trees | 2020-06-16 | Paper |
| The oriented size Ramsey number of directed paths | 2020-06-16 | Paper |
| Counting odd cycle free orientations of graphs | 2020-06-02 | Paper |
| Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} | 2020-05-27 | Paper |
| Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes | 2020-05-04 | Paper |
| The regularity method for graphs with few 4-cycles | 2020-04-21 | Paper |
| Long Monotone Trails in Random Edge-Labellings of Random Graphs | 2020-04-06 | Paper |
| Submodular minimization under congruency constraints | 2020-02-26 | Paper |
| Books versus Triangles at the Extremal Density | 2020-02-13 | Paper |
| An extremal problem for integer sparse recovery | 2019-12-19 | Paper |
| Decompositions into spanning rainbow structures | 2019-11-28 | Paper |
| An algebraic perspective on integer sparse recovery | 2019-11-22 | Paper |
| Tower-type bounds for unavoidable patterns in words | 2019-10-31 | Paper |
| Proof of a conjecture on induced subgraphs of Ramsey graphs | 2019-10-24 | Paper |
| Hypergraph cuts above the average | 2019-10-08 | Paper |
| Multicolour bipartite Ramsey number of paths | 2019-09-30 | Paper |
| Robustness of graph properties | 2019-09-25 | Paper |
| Counting Hamilton Decompositions of Oriented Graphs | 2019-09-09 | Paper |
| Directed Ramsey number for trees | 2019-07-17 | Paper |
| A counterexample to Stein’s Equi-$n$-square Conjecture | 2019-05-23 | Paper |
| Equiangular subspaces in Euclidean spaces | 2019-04-25 | Paper |
| Monochromatic paths in random tournaments | 2019-02-20 | Paper |
| Counting Hamilton cycles in sparse random directed graphs | 2019-02-20 | Paper |
| Monochromatic cycle covers in random graphs | 2019-02-20 | Paper |
| The random k‐matching‐free process | 2019-02-20 | Paper |
| The Zero Forcing Number of Graphs | 2019-01-16 | Paper |
| Independent arithmetic progressions | 2019-01-15 | Paper |
| On Kahn's basis conjecture | 2018-10-17 | Paper |
| Linearly many rainbow trees in properly edge-coloured complete graphs | 2018-07-24 | Paper |
| Packing Hamilton Cycles Online | 2018-07-24 | Paper |
| Anagram-Free Colourings of Graphs | 2018-07-24 | Paper |
| On the maximum quartet distance between phylogenetic trees | 2018-07-16 | Paper |
| Hereditary quasirandomness without regularity | 2018-07-13 | Paper |
| Two-Sided, Unbiased Version of Hall’s Marriage Theorem | 2018-07-13 | Paper |
| Testing Equality in Communication Graphs | 2018-06-27 | Paper |
| Intercalates and discrepancy in random Latin squares | 2018-06-07 | Paper |
| Ramsey Goodness of Bounded Degree Trees | 2018-04-23 | Paper |
| Cycles in triangle-free graphs of large chromatic number | 2018-04-12 | Paper |
| Submodular minimization under congruency constraints | 2018-03-15 | Paper |
| Embedding rainbow trees with applications to graph labelling and decomposition | 2018-03-08 | Paper |
| On the densities of cliques and independent sets in graphs | 2018-02-22 | Paper |
| Compatible Hamilton cycles in Dirac graphs | 2018-02-12 | Paper |
| Equiangular lines and spherical codes in Euclidean space | 2018-01-26 | Paper |
| Equiangular lines and subspaces in Euclidean spaces | 2018-01-18 | Paper |
| Monochromatic paths in random tournaments | 2018-01-18 | Paper |
| Anagram-free colorings of graphs | 2018-01-18 | Paper |
| Edge-disjoint rainbow trees in properly coloured complete graphs | 2018-01-18 | Paper |
| Directed Ramsey number for trees | 2018-01-18 | Paper |
| The number of Hamiltonian decompositions of regular graphs | 2017-12-21 | Paper |
| Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles | 2017-12-21 | Paper |
| Supersaturation in posets and applications involving the container method | 2017-11-09 | Paper |
| Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs | 2017-10-10 | Paper |
| The Threshold Probability for Long Cycles | 2017-10-10 | Paper |
| Maximizing the Number of Independent Sets of a Fixed Size | 2017-10-04 | Paper |
| Sperner's Theorem and a Problem of Erdős, Katona and Kleitman | 2017-10-04 | Paper |
| Decomposing Random Graphs into Few Cycles and Edges | 2017-10-04 | Paper |
| The number of additive triples in subsets of abelian groups | 2017-09-28 | Paper |
| Saturation in random graphs | 2017-09-26 | Paper |
| On graphs decomposable into induced matchings of linear sizes | 2017-09-13 | Paper |
| Bounded colorings of multipartite graphs and hypergraphs | 2017-09-11 | Paper |
| The minimum number of disjoint pairs in set systems and related problems | 2017-04-25 | Paper |
| Ramsey numbers of cubes versus cliques | 2017-03-31 | Paper |
| The extremal function for cycles of length \(\ell\) mod \(k\) | 2017-02-17 | Paper |
| Bounded-Degree Spanning Trees in Randomly Perturbed Graphs | 2017-01-27 | Paper |
| Recent developments in graph Ramsey theory | 2016-12-20 | Paper |
| Domination in 3-tournaments | 2016-11-29 | Paper |
| Counting and packing Hamilton cycles in dense graphs and oriented graphs | 2016-11-25 | Paper |
| Ramsey goodness of paths | 2016-11-25 | Paper |
| Properly colored and rainbow copies of graphs with few cherries | 2016-11-25 | Paper |
| Ordered Ramsey numbers | 2016-11-25 | Paper |
| Some remarks on rainbow connectivity | 2016-11-17 | Paper |
| Compatible Hamilton cycles in random graphs | 2016-11-09 | Paper |
| Some remarks on rainbow connectivity | 2016-10-14 | Paper |
| Cycles and matchings in randomly perturbed digraphs and hypergraphs | 2016-10-14 | Paper |
| A random triadic process | 2016-10-14 | Paper |
| Properly colored and rainbow copies of graphs with few cherries | 2016-10-14 | Paper |
| Short proofs of some extremal results. II. | 2016-10-12 | Paper |
| Random directed graphs are robustly Hamiltonian | 2016-09-15 | Paper |
| Small complete minors above the extremal edge density | 2016-09-09 | Paper |
| Coloring random graphs | 2016-06-09 | Paper |
| On the Maximum Quartet Distance between Phylogenetic Trees | 2016-04-15 | Paper |
| Bounds for spherical codes | 2016-02-24 | Paper |
| Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs | 2016-02-19 | Paper |
| Judicious partitions of directed graphs | 2016-02-03 | Paper |
| A Random Triadic Process | 2016-01-15 | Paper |
| Discrepancy of random graphs and hypergraphs | 2015-10-12 | Paper |
| On the Grid Ramsey Problem and Related Questions: Fig. 1. | 2015-10-02 | Paper |
| On the number of monotone sequences | 2015-08-21 | Paper |
| Comparable pairs in families of sets | 2015-08-21 | Paper |
| Cycle packing | 2015-06-22 | Paper |
| Swarming on random graphs. II | 2015-05-08 | Paper |
| Most probably intersecting hypergraphs | 2015-04-22 | Paper |
| Long paths and cycles in random subgraphs of graphs with large minimum degree | 2015-04-09 | Paper |
| Ramsey-type results for semi-algebraic relations | 2015-02-17 | Paper |
| The Erdős-Gyárfás problem on generalized Ramsey numbers | 2015-01-26 | Paper |
| A Construction of Almost Steiner Systems | 2014-12-22 | Paper |
| Musical Chairs | 2014-12-22 | Paper |
| \(K_{s,t}\)-saturated bipartite graphs | 2014-12-19 | Paper |
| Bisections of graphs | 2014-10-13 | Paper |
| A problem of Erdős on the minimum number of \(k\)-cliques | 2014-10-06 | Paper |
| Ramsey-type results for semi-algebraic relations | 2014-09-19 | Paper |
| How many colors guarantee a rainbow matching? | 2014-09-04 | Paper |
| The minimum number of nonnegative edges in hypergraphs | 2014-09-04 | Paper |
| Cores of random graphs are born Hamiltonian | 2014-08-08 | Paper |
| On the 3‐Local Profiles of Graphs | 2014-08-07 | Paper |
| Robust Hamiltonicity of Dirac graphs | 2014-06-11 | Paper |
| Nearly complete graphs decomposable into large induced matchings and their applications | 2014-05-13 | Paper |
| Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz | 2014-05-05 | Paper |
| Short Proofs of Some Extremal Results | 2014-05-02 | Paper |
| On a conjecture of Erdős and Simonovits: even cycles | 2014-03-17 | Paper |
| Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs | 2014-02-24 | Paper |
| All-Pairs Shortest Paths in $O(n^2)$ time with high probability | 2014-02-17 | Paper |
| Two extensions of Ramsey's theorem | 2014-01-27 | Paper |
| Large subgraphs without complete bipartite graphs | 2014-01-26 | Paper |
| An improved bound for the stepping-up lemma | 2013-11-29 | Paper |
| On two problems in graph Ramsey theory | 2013-11-07 | Paper |
| Maximum union-free subfamilies | 2013-11-01 | Paper |
| The phase transition in random graphs: A simple proof | 2013-10-09 | Paper |
| Self-Similarity of Graphs | 2013-09-26 | Paper |
| Nearly complete graphs decomposable into large induced matchings and their applications | 2013-09-02 | Paper |
| Longest cycles in sparse random digraphs | 2013-08-27 | Paper |
| Rainbow Turán problem for even cycles | 2013-03-19 | Paper |
| Decompositions into Subgraphs of Small Diameter | 2013-03-13 | Paper |
| Erdős-Szekeres-type theorems for monotone paths and convex bodies | 2012-11-30 | Paper |
| Dirac's theorem for random graphs | 2012-10-31 | Paper |
| Erdős-Hajnal-type theorems in hypergraphs | 2012-10-19 | Paper |
| A counterexample to the Alon-Saks-Seymour conjecture and related problems | 2012-09-17 | Paper |
| Getting a Directed Hamilton Cycle Two Times Faster | 2012-09-12 | Paper |
| Sidorenko's conjecture for a class of graphs: an exposition | 2012-09-02 | Paper |
| Long cycles in subgraphs of (pseudo)random directed graphs | 2012-07-10 | Paper |
| Long paths and cycles in random subgraphs of graphs with large minimum degree | 2012-07-02 | Paper |
| Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels | 2012-06-04 | Paper |
| The Size of a Hypergraph and its Matching Number | 2012-06-04 | Paper |
| Biased orientation games | 2012-05-30 | Paper |
| The size Ramsey number of a directed path | 2012-05-11 | Paper |
| Nonnegative \(k\)-sums, fractional covers, and probability of small deviations | 2012-05-11 | Paper |
| Hamiltonicity, independence number, and pancyclicity | 2012-05-04 | Paper |
| Bandwidth theorem for random graphs | 2012-03-19 | Paper |
| On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs | 2012-03-15 | Paper |
| A Bound for the Cops and Robbers Problem | 2012-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096709 | 2011-11-11 | Paper |
| Oblivious Collaboration | 2011-10-28 | Paper |
| Generating all subsets of a finite set with disjoint unions | 2011-10-21 | Paper |
| Cycles in graphs with large independence ratio | 2011-08-23 | Paper |
| Spectra of lifted Ramanujan graphs | 2011-07-25 | Paper |
| A randomized embedding algorithm for trees | 2011-07-22 | Paper |
| Increasing the chromatic number of a random graph | 2011-06-27 | Paper |
| Regular induced subgraphs of a random Graph | 2011-05-11 | Paper |
| Large almost monochromatic subsets in hypergraphs | 2011-05-05 | Paper |
| A conjecture of Erdős on graph Ramsey numbers | 2011-04-20 | Paper |
| Resilient Pancyclicity of Random and Pseudorandom Graphs | 2011-03-15 | Paper |
| Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs | 2011-03-07 | Paper |
| Ramsey games with giants | 2011-01-17 | Paper |
| Dependent random choice | 2011-01-17 | Paper |
| An approximate version of Sidorenko's conjecture | 2011-01-07 | Paper |
| Maximizing the number of q -colorings | 2010-11-26 | Paper |
| Hamiltonicity thresholds in Achlioptas processes | 2010-11-24 | Paper |
| Ramsey numbers of sparse hypergraphs | 2010-11-09 | Paper |
| Cycles in Sparse Graphs II | 2010-10-25 | Paper |
| Hypergraph Ramsey numbers | 2010-08-27 | Paper |
| Simulating independence | 2010-08-16 | Paper |
| Density theorems for bipartite graphs and related Ramsey-type results | 2010-08-13 | Paper |
| Simulating independence | 2010-07-14 | Paper |
| Pancyclicity of Hamiltonian and highly connected graphs | 2010-06-03 | Paper |
| Constrained Ramsey Numbers | 2010-04-23 | Paper |
| Directed Graphs Without Short Cycles | 2010-04-23 | Paper |
| On the Random Satisfiable Process | 2010-04-22 | Paper |
| Paths and stability number in digraphs | 2010-03-26 | Paper |
| Ramsey-Type Problem for an Almost Monochromatic $K_4$ | 2010-03-17 | Paper |
| Discrete Kakeya-type problems and small bases | 2010-01-26 | Paper |
| Two remarks on the Burr-Erdős conjecture | 2009-11-30 | Paper |
| Large Nearly Regular Induced Subgraphs | 2009-11-27 | Paper |
| Additive approximation for edge-deletion problems | 2009-07-15 | Paper |
| Minors in expanding graphs | 2009-07-06 | Paper |
| Triangle packings and 1-factors in oriented graphs | 2009-06-23 | Paper |
| Large induced trees in \(K_r\)-free graphs | 2009-03-04 | Paper |
| Local resilience of graphs | 2009-03-04 | Paper |
| Avoiding small subgraphs in Achlioptas processes | 2009-03-04 | Paper |
| Covering codes with improved density | 2008-12-21 | Paper |
| Unavoidable patterns | 2008-12-08 | Paper |
| Ramsey Numbers and the Size of Graphs | 2008-12-05 | Paper |
| Induced Ramsey-type theorems | 2008-11-12 | Paper |
| Making a \(K_4\)-free graph bipartite | 2008-10-22 | Paper |
| Embedding nearly-spanning bounded degree trees | 2008-10-22 | Paper |
| Cycle lengths in sparse graphs | 2008-10-21 | Paper |
| On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs | 2008-10-07 | Paper |
| On the strong chromatic number of random graphs | 2008-07-21 | Paper |
| Constrained Ramsey Numbers | 2008-06-05 | Paper |
| Induced Ramsey-type theorems | 2008-06-05 | Paper |
| How many random edges make a dense hypergraph non-2-colorable? | 2008-06-05 | Paper |
| The game chromatic number of random graphs | 2008-03-28 | Paper |
| Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality | 2008-02-22 | Paper |
| On graphs with subgraphs having large independence numbers | 2008-01-04 | Paper |
| Independent transversals in locally sparse graphs | 2007-10-10 | Paper |
| Nearly optimal embeddings of trees | 2007-07-13 | Paper |
| Induced subgraphs of Ramsey graphs with many distinct degrees | 2007-06-08 | Paper |
| Small subgraphs of random regular graphs | 2007-05-23 | Paper |
| Rainbow Turán Problems | 2007-03-20 | Paper |
| On smoothed analysis in dense graphs and formulas | 2007-02-07 | Paper |
| A Ramsey-type result for the hypercube | 2007-02-07 | Paper |
| On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs | 2007-01-16 | Paper |
| On a restricted cross-intersection problem | 2006-12-07 | Paper |
| Bounding the number of edges in permutation graphs | 2006-08-30 | Paper |
| Sparse halves in triangle-free graphs | 2006-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477817 | 2006-06-29 | Paper |
| The Turán number of the Fano plane | 2006-06-27 | Paper |
| On a hypergraph Turán problem of Frankl | 2006-06-27 | Paper |
| A new lower bound for a Ramsey-type problem | 2006-06-27 | Paper |
| The Strong Chromatic Index of Random Graphs | 2006-06-01 | Paper |
| \(H\)-free graphs of large minimum degree | 2006-03-22 | Paper |
| MaxCut in ${\bm H)$-Free Graphs | 2005-11-14 | Paper |
| Disjoint representability of sets and their complements | 2005-09-28 | Paper |
| On a question of Erdős and Moser | 2005-09-26 | Paper |
| Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices | 2005-09-16 | Paper |
| A generalization of Turán's theorem | 2005-08-01 | Paper |
| Triangle factors in sparse pseudo-random graphs | 2005-07-05 | Paper |
| List colouring when the chromatic number is close to the order of the graph | 2005-07-05 | Paper |
| Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems | 2005-06-01 | Paper |
| THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES | 2005-03-14 | Paper |
| Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions | 2005-03-08 | Paper |
| On Ramsey Numbers of Sparse Graphs | 2005-03-08 | Paper |
| Graph products, Fourier analysis and spectral techniques | 2005-02-24 | Paper |
| Learning a Hidden Matching | 2005-02-21 | Paper |
| Packing triangles in a graph and its complement | 2005-02-16 | Paper |
| On the value of a random minimum weight Steiner tree | 2005-02-14 | Paper |
| Multicolour Turán problems | 2004-10-12 | Paper |
| Multicoloured extremal problems | 2004-10-01 | Paper |
| Approximate coloring of uniform hypergraphs | 2004-10-01 | Paper |
| On the number of edges not covered by monochromatic copies of a fixed graph. | 2004-03-15 | Paper |
| Extremal set systems with restricted \(k\)-wise intersections. | 2004-03-14 | Paper |
| Local Density in Graphs with Forbidden Subgraphs | 2003-09-24 | Paper |
| A few remarks on Ramsey--Turán-type problems | 2003-08-25 | Paper |
| On the largest eigenvalue of a random subgraph of the hypercube | 2003-08-21 | Paper |
| Induced subgraphs of prescribed size | 2003-08-20 | Paper |
| Maximum cuts and judicious partitions in graphs without short cycles | 2003-08-17 | Paper |
| The Largest Eigenvalue of Sparse Random Graphs | 2003-06-13 | Paper |
| A Sharp Threshold for Network Reliability | 2003-04-11 | Paper |
| On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances | 2003-03-26 | Paper |
| Sparse pseudo‐random graphs are Hamiltonian | 2003-03-19 | Paper |
| On the asymmetry of random regular graphs and random graphs | 2003-03-19 | Paper |
| On the probability of independent sets in random graphs | 2003-03-19 | Paper |
| Nowhere-zero flows in random graphs | 2002-12-10 | Paper |
| Asymptotically the list colouring constants are 1 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549228 | 2002-11-07 | Paper |
| Acyclic edge colorings of graphs | 2002-11-06 | Paper |
| Random regular graphs of high degree | 2002-11-06 | Paper |
| Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs | 2002-08-01 | Paper |
| Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768313 | 2002-03-24 | Paper |
| A note on odd cycle-complete graph Ramsey numbers | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768278 | 2002-01-30 | Paper |
| Asymptotically optimal tree-packings in regular graphs | 2001-12-11 | Paper |
| Note on alternating directed cycles | 2000-11-02 | Paper |
| Bipartite Subgraphs and the Smallest Eigenvalue | 2000-10-08 | Paper |
| Coloring graphs with sparse neighborhoods | 2000-06-25 | Paper |
| On Two Segmentation Problems | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954420 | 2000-06-07 | Paper |
| List coloring of random and pseudo-random graphs | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705318 | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705344 | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252044 | 1999-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250228 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4351317 | 1998-03-02 | Paper |
| A note on \(\tau\)-critical linear hypergraphs | 1998-01-21 | Paper |
| Disjoint systems | 1995-02-09 | Paper |
