| Tilings in Randomly Perturbed Dense Graphs |
10 |
| A Simple SVD Algorithm for Finding Hidden Partitions |
7 |
| Colourings of Uniform Hypergraphs with Large Girth and Applications |
5 |
| Weighted counting of solutions to sparse systems of equations |
4 |
| Drift Analysis and Evolutionary Algorithms Revisited |
4 |
| A Stronger Bound for the Strong Chromatic Index |
3 |
| Separation Choosability and Dense Bipartite Induced Subgraphs |
3 |
| Largest Components in Random Hypergraphs |
3 |
| Eigenvalue Ratios of Non-Negatively Curved Graphs |
2 |
| Distance Colouring Without One Cycle Length |
2 |
| Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles |
2 |
| Logarithmic Sobolev inequalities in discrete product spaces |
2 |
| Inversions in Split Trees and Conditional Galton-Watson Treest |
2 |
| Induced Turan Numbers |
2 |
| A Tutte Polynomial for Maps |
2 |
| Bisections of Graphs Without Short Cycles |
2 |
| Induced Subgraphs With Many Distinct Degrees |
2 |
| Linear Turan Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers |
2 |
| Restricted completion of sparse partial Latin squares |
2 |
| Decomposing edge-coloured graphs under colour degree constraints |
2 |
| Triangle-Tilings in Graphs Without Large Independent Sets |
2 |
| Subcritical Graph Classes Containing All Planar Graph |
1 |
| The Number of Satisfying Assignments of Random Regular k-SAT Formulas |
1 |
| A near-exponential improvement of a bound of Erdos and Lovasz on maximal intersecting families |
1 |
| An Extremal Graph Problem with a Transcendental Solution |
1 |
| Bounding the Size of an Almost-Equidistant Set in Euclidean Space |
1 |
| Limit Shapes via Bijections |
1 |
| Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives |
1 |
| Exact Distance Colouring in Trees |
1 |
| Robust Tverberg and Colourful Caratheodory Results via Random Choice |
1 |
| Ramsey Goodness of Bounded Degree Trees |
1 |
| On Zeros of a Polynomial in a Finite Grid |
1 |
| A central limit theorem for additive functionals of increasing trees |
1 |
| Asymmetric Renyi Problem |
1 |
| Limit laws of planar maps with prescribed vertex degrees |
1 |
| Counting Intersecting and Pairs of Cross-Intersecting Families |
1 |
| Density of Chromatic Roots in Minor-Closed Graph Families |
1 |
| Volumes in the Uniform Infinite Planar Triangulation: From Skeletons to Generating Functions |
1 |
| The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph |
1 |
| Anagram-Free Colourings of Graphs |
1 |
| A Combinatorial Approach to Small Ball Inequalities for Sums and Differences |
1 |
| On the Number of Solutions in Random Graph k-Colouring |
1 |
| Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs |
1 |
| Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings |
1 |
| Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs |
1 |
| On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph |
1 |
| Phase Coexistence for the Hard-Core Model on Z(2) |
1 |
| Parking on a Random Tree |
1 |
| Indistinguishable Sceneries on the Boolean Hypercube |
0 |
| Triangle-Free Subgraphs of Random Graphs |
0 |
