| Publication | Date of Publication | Type |
|---|
Reconstruction of shredded random matrices
Journal of Combinatorial Theory. Series B | 2026-06-16 | Paper |
Short reachability networks
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
Covering complete geometric graphs by monotone paths
Combinatorics and Number Theory | 2026-05-12 | Paper |
The vertex sets of subtrees of a tree
The Electronic Journal of Combinatorics | 2026-04-29 | Paper |
Induced subgraph density. VII: The five-vertex path
Proceedings of the London Mathematical Society. Third Series | 2026-03-30 | Paper |
Distant digraph domination
The Electronic Journal of Combinatorics | 2026-03-20 | Paper |
Trees and near-linear stable sets
Combinatorica | 2025-12-08 | Paper |
Induced subgraph density. VI: Bounded VC-dimension
Advances in Mathematics | 2025-12-04 | Paper |
A multidimensional Ramsey theorem
Discrete Analysis | 2025-09-12 | Paper |
Subdivisions and near-linear stable sets
Combinatorica | 2025-07-25 | Paper |
Improved bounds for 1-independent percolation on \(\mathbb{Z}^n\)
Electronic Journal of Probability | 2025-06-27 | Paper |
Counting graphic sequences via integrated random walks
Transactions of the American Mathematical Society | 2025-06-17 | Paper |
Induced C₄-free subgraphs with large average degree
Journal of Combinatorial Theory. Series B | 2025-05-07 | Paper |
Some results and problems on tournament structure
Journal of Combinatorial Theory. Series B | 2025-05-07 | Paper |
A counterexample to the coarse Menger conjecture
Journal of Combinatorial Theory. Series B | 2025-05-07 | Paper |
Lower bounds for graph reconstruction with maximal independent set queries
Theoretical Computer Science | 2025-03-11 | Paper |
Graphs without a 3-connected subgraph are 4-colourable
The Electronic Journal of Combinatorics | 2025-03-06 | Paper |
The structure and density of k-product-free sets in the free semigroup and group
Journal of the London Mathematical Society. Second Series | 2025-01-30 | Paper |
A note on graphs of k-colourings
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Graphs with arbitrary Ramsey number and connectivity
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Pure pairs. VIII: Excluding a sparse graph
Combinatorica | 2025-01-14 | Paper |
Publisher erratum: ``Flashes and rainbows in tournaments''
Combinatorica | 2025-01-14 | Paper |
Induced subgraph density. II: Sparse and dense sets in cographs
European Journal of Combinatorics | 2024-12-27 | Paper |
Boundary rigidity of 3D CAT(0) cube complexes
European Journal of Combinatorics | 2024-12-27 | Paper |
Product structure of graphs with an excluded minor
Transactions of the American Mathematical Society. Series B | 2024-12-17 | Paper |
Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph
Journal of Graph Theory | 2024-11-24 | Paper |
Reconstructing a point set from a random subset of its pairwise distances
SIAM Journal on Discrete Mathematics | 2024-11-05 | Paper |
Induced subgraph density. I: A loglog step towards Erdős-Hajnal
IMRN. International Mathematics Research Notices | 2024-10-25 | Paper |
Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
Journal of the European Mathematical Society (JEMS) | 2024-08-02 | Paper |
Induced subgraphs of induced subgraphs of large chromatic number
Combinatorica | 2024-04-09 | Paper |
Defective coloring of hypergraphs
Random Structures & Algorithms | 2024-03-25 | Paper |
Graphs of large chromatic number
International Congress of Mathematicians | 2024-03-20 | Paper |
Pure Pairs. IX. Transversal Trees
SIAM Journal on Discrete Mathematics | 2024-02-07 | Paper |
Bipartite graphs with no \(K_6\) minor
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Invertibility of Digraphs and Tournaments
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
On a problem of El-Zahar and Erdős
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
| Induced subgraph density. VII. The five-vertex path | 2023-12-23 | Paper |
Optimal labelling schemes for adjacency, comparability, and reachability
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Graphs with arbitrary Ramsey number and connectivity | 2023-11-03 | Paper |
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
European Journal of Combinatorics | 2023-10-25 | Paper |
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions
Random Structures & Algorithms | 2023-10-19 | Paper |
The component structure of dense random subgraphs of the hypercube
Random Structures & Algorithms | 2023-10-12 | Paper |
The component structure of dense random subgraphs of the hypercube
Random Structures & Algorithms | 2023-10-12 | Paper |
Shotgun reconstruction in the hypercube
Random Structures & Algorithms | 2023-10-12 | Paper |
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
Journal of Graph Theory | 2023-10-06 | Paper |
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
Journal of Graph Theory | 2023-10-06 | Paper |
Polynomial bounds for chromatic number II: Excluding a star‐forest
Journal of Graph Theory | 2023-10-05 | Paper |
Polynomial bounds for chromatic number. III. Excluding a double star
Journal of Graph Theory | 2023-10-05 | Paper |
Polynomial bounds for chromatic number. III. Excluding a double star
Journal of Graph Theory | 2023-10-05 | Paper |
Polynomial bounds for chromatic number VII. Disjoint holes
Journal of Graph Theory | 2023-10-05 | Paper |
Pure pairs. V: Excluding some long subdivision
Combinatorica | 2023-10-04 | Paper |
Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
Combinatorica | 2023-10-04 | Paper |
Size reconstructibility of graphs
Journal of Graph Theory | 2023-09-29 | Paper |
Best-response dynamics, playing sequences, and convergence to equilibrium in random games
International Journal of Game Theory | 2023-09-25 | Paper |
Erdős–Hajnal for graphs with no 5‐hole
Proceedings of the London Mathematical Society | 2023-09-20 | Paper |
| Game Connectivity and Adaptive Dynamics | 2023-09-19 | Paper |
Strengthening Rödl's theorem
Journal of Combinatorial Theory. Series B | 2023-09-19 | Paper |
| Boundary rigidity of 3D CAT(0) cube complexes | 2023-09-08 | Paper |
| Induced subgraph density. V. All paths approach Erdos-Hajnal | 2023-07-27 | Paper |
| Induced C₄-free subgraphs with large average degree | 2023-07-17 | Paper |
| Induced subgraph density. II. Sparse and dense sets in cographs | 2023-07-03 | Paper |
Decomposing Random Permutations into Order-Isomorphic Subpermutations
SIAM Journal on Discrete Mathematics | 2023-06-27 | Paper |
Parking on the integers
The Annals of Applied Probability | 2023-06-05 | Paper |
| Some results and problems on tournament structure | 2023-06-04 | Paper |
| Flashes and rainbows in tournaments | 2023-05-22 | Paper |
| The structure and density of k-product-free sets in the free semigroup | 2023-05-09 | Paper |
Pure pairs. IV: Trees in bipartite graphs
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Polynomial bounds for chromatic number VI. Adding a four-vertex path
European Journal of Combinatorics | 2023-04-27 | Paper |
Balancing connected colourings of graphs
The Electronic Journal of Combinatorics | 2023-04-19 | Paper |
Clustered colouring of graph classes with bounded treedepth or pathwidth
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
Powers of paths in tournaments
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
Lipschitz bijections between boolean functions
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
| Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph | 2023-03-21 | Paper |
| Reconstructing a point set from a random subset of its pairwise distances | 2023-01-26 | Paper |
| Counting graphic sequences via integrated random walks | 2023-01-17 | Paper |
| Shotgun assembly of random graphs | 2022-11-25 | Paper |
| A multidimensional Ramsey Theorem | 2022-10-17 | Paper |
Reconstructing the degree sequence of a sparse graph from a partial deck
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
| Perfect shuffling with fewer lazy transpositions | 2022-08-13 | Paper |
| Short reachability networks | 2022-08-13 | Paper |
| Improved bounds for 1-independent percolation on $\mathbb{Z}^n$ | 2022-06-24 | Paper |
Concatenating bipartite graphs
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Balancing connected colourings of graphs
(available as arXiv preprint) | 2022-05-10 | Paper |
A survey of -boundedness
Journal of Graph Theory | 2022-03-31 | Paper |
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs
Journal of Graph Theory | 2022-03-31 | Paper |
A Note on Infinite Antichain Density
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Combinatorics in the exterior algebra and the Bollobás two families theorem
Journal of the London Mathematical Society | 2022-02-24 | Paper |
Polynomial bounds for chromatic number VI. Adding a four-vertex path
(available as arXiv preprint) | 2022-02-21 | Paper |
Finding a Shortest Odd Hole
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Exact stability for Turán's theorem
Advances in Combinatorics | 2022-02-10 | Paper |
| Pure pairs. VIII. Excluding a sparse graph | 2022-01-11 | Paper |
Pure pairs. VI: Excluding an ordered tree
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
| Active clustering for labeling training data | 2021-10-27 | Paper |
Separation dimension and degree
Mathematical Proceedings of the Cambridge Philosophical Society | 2021-09-14 | Paper |
A universal exponent for homeomorphs
Israel Journal of Mathematics | 2021-08-24 | Paper |
A note on simplicial cliques
Discrete Mathematics | 2021-07-08 | Paper |
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
Journal of Combinatorial Theory. Series B | 2021-07-06 | Paper |
Detecting a long odd hole
Combinatorica | 2021-06-25 | Paper |
| Powers of paths and cycles in tournaments | 2021-05-26 | Paper |
| Product structure of graphs with an excluded minor | 2021-04-14 | Paper |
| Reconstruction from smaller cards | 2021-03-24 | Paper |
Exceptional graphs for the random walk
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2021-02-15 | Paper |
Exceptional graphs for the random walk
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2021-02-15 | Paper |
Maximising the number of cycles in graphs with forbidden subgraphs
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
Monochromatic components in edge-coloured graphs with large minimum degree
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
Pure pairs. I: Trees and linear anticomplete pairs
Advances in Mathematics | 2020-12-03 | Paper |
Detecting an Odd Hole
Journal of the ACM | 2020-11-11 | Paper |
Induced subgraphs of graphs with large chromatic number. VI. Banana trees
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Proof of the Kalai-Meshulam conjecture
Israel Journal of Mathematics | 2020-09-15 | Paper |
Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
Transactions of the American Mathematical Society | 2020-07-17 | Paper |
| Surfaces have (asymptotic) dimension 2 | 2020-07-07 | Paper |
Partitioning the vertices of a torus into isomorphic subgraphs
Journal of Combinatorial Theory. Series A | 2020-04-27 | Paper |
Finding a shortest odd hole
(available as arXiv preprint) | 2020-04-24 | Paper |
Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Better bounds for poset dimension and boxicity
Transactions of the American Mathematical Society | 2020-02-26 | Paper |
Clustered colouring in minor-closed classes
Combinatorica | 2020-02-26 | Paper |
Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
Combinatorica | 2020-01-17 | Paper |
Towards Erdős-Hajnal for graphs with no 5-hole
Combinatorica | 2020-01-17 | Paper |
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Induced subgraphs of graphs with large chromatic number. XII. Distant stars
Journal of Graph Theory | 2019-12-30 | Paper |
Induced subgraphs of graphs with large chromatic number. XIII. New brooms
European Journal of Combinatorics | 2019-11-28 | Paper |
Maximising H-colourings of graphs
Journal of Graph Theory | 2019-10-31 | Paper |
\(H\)-colouring \(P_t\)-free graphs in subexponential time
Discrete Applied Mathematics | 2019-09-05 | Paper |
Near-domination in graphs
Journal of Combinatorial Theory. Series A | 2019-06-25 | Paper |
Bad News for Chordal Partitions
(available as arXiv preprint) | 2019-06-14 | Paper |
Disjoint paths in unions of tournaments
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Balancing sums of random vectors
Discrete Analysis | 2019-01-09 | Paper |
Induced subgraphs of graphs with large chromatic number. XI. Orientations
European Journal of Combinatorics | 2018-12-20 | Paper |
| A logarithmic bound for the chromatic number of the associahedron | 2018-11-21 | Paper |
| Sparse graphs with no polynomial-sized anticomplete pairs | 2018-09-28 | Paper |
Stability results for graphs with a critical edge
European Journal of Combinatorics | 2018-09-07 | Paper |
How unproportional must a graph be?
European Journal of Combinatorics | 2018-08-24 | Paper |
How unproportional must a graph be?
European Journal of Combinatorics | 2018-08-24 | Paper |
| Size reconstructibility of graphs | 2018-07-31 | Paper |
Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
Journal of Combinatorial Theory. Series B | 2018-07-24 | Paper |
Induced subgraphs of graphs with large chromatic number. III: Long holes
Combinatorica | 2018-07-23 | Paper |
| Approximating the position of a hidden agent in a graph | 2018-05-11 | Paper |
On a problem of Erdős and Moser
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 2018-01-05 | Paper |
Supersaturation in posets and applications involving the container method
Journal of Combinatorial Theory. Series A | 2017-11-09 | Paper |
Supersaturation in posets and applications involving the container method
Journal of Combinatorial Theory. Series A | 2017-11-09 | Paper |
Saturation in the hypercube and bootstrap percolation
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Packing random graphs and hypergraphs
Random Structures & Algorithms | 2017-09-26 | Paper |
A note on intersecting hypergraphs with large cover number
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
A note on intersecting hypergraphs with large cover number
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Maximising the number of induced cycles in a graph
Journal of Combinatorial Theory. Series B | 2017-08-22 | Paper |
Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
On Lower Bounds for the Matching Number of Subcubic Graphs
Journal of Graph Theory | 2017-07-05 | Paper |
Uniform multicommodity flows in the hypercube with random edge‐capacities
Random Structures & Algorithms | 2017-06-02 | Paper |
Uniform multicommodity flows in the hypercube with random edge‐capacities
Random Structures & Algorithms | 2017-06-02 | Paper |
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
Distributed Computing | 2017-04-04 | Paper |
The parameterised complexity of list problems on graphs of bounded treewidth
Information and Computation | 2016-11-18 | Paper |
Induced subgraphs of graphs with large chromatic number. I. Odd holes
Journal of Combinatorial Theory. Series B | 2016-10-12 | Paper |
Random graphs from a block-stable class
European Journal of Combinatorics | 2016-08-16 | Paper |
Disjoint dijoins
Journal of Combinatorial Theory. Series B | 2016-06-03 | Paper |
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
Disjoint induced subgraphs of the same order and size
European Journal of Combinatorics | 2015-06-18 | Paper |
Feedback from nature, an optimal distributed algorithm for \textsc{Maximal Independent Set} selection
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Spanning trees and the complexity of flood-filling games
Theory of Computing Systems | 2015-01-21 | Paper |
Spanning trees and the complexity of flood-filling games
Theory of Computing Systems | 2015-01-21 | Paper |
Complete monotonicity for inverse powers of some combinatorially defined polynomials
Acta Mathematica | 2014-12-17 | Paper |
Disjoint paths in tournaments
Advances in Mathematics | 2014-12-12 | Paper |
Intersections of hypergraphs
Journal of Combinatorial Theory. Series B | 2014-11-21 | Paper |
Intersections of random hypergraphs and tournaments
European Journal of Combinatorics | 2014-11-19 | Paper |
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms | 2014-11-18 | Paper |
For most graphs H, most H-free graphs have a linear homogeneous set
Random Structures & Algorithms | 2014-11-17 | Paper |
Substitution and \(\chi\)-boundedness
Journal of Combinatorial Theory. Series B | 2014-10-13 | Paper |
On saturated k-Sperner systems
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
On saturated k-Sperner systems
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Excluding pairs of graphs
Journal of Combinatorial Theory. Series B | 2014-08-28 | Paper |
Hypergraphs of Bounded Disjointness
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
A counterexample to a conjecture of Schwartz
Social Choice and Welfare | 2014-05-30 | Paper |
The complexity of free-flood-it on \(2\times n\) boards
Theoretical Computer Science | 2013-12-19 | Paper |
Cover-decomposition and polychromatic numbers
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Tournaments and colouring
Journal of Combinatorial Theory. Series B | 2013-01-18 | Paper |
Excluding induced subdivisions of the bull and related graphs
Journal of Graph Theory | 2012-09-12 | Paper |
On Ryser's conjecture
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
The complexity of flood-filling games on graphs
Discrete Applied Mathematics | 2012-05-30 | Paper |
Monochromatic cycles in 2-coloured graphs
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
A bound for the cops and robbers problem
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
The minimal covering set in large tournaments
Social Choice and Welfare | 2012-01-13 | Paper |
Cover-decomposition and polychromatic numbers
Lecture Notes in Computer Science | 2011-09-16 | Paper |
| Monochromatic cycles and the monochromatic circumference in 2-coloured graphs | 2011-07-26 | Paper |
Szemerédi's regularity Lemma for matrices and sparse graphs
Combinatorics, Probability and Computing | 2011-05-11 | Paper |
Intersections of graphs
Journal of Graph Theory | 2011-04-19 | Paper |
| Almost all H-free graphs have the Erdős-Hajnal property | 2011-02-18 | Paper |
| Covering numbers for graphs and hypergraphs | 2010-09-29 | Paper |
| Structure of random r-SAT below the pure literal threshold | 2010-08-06 | Paper |
Max \(k\)-cut and judicious \(k\)-partitions
Discrete Mathematics | 2010-07-07 | Paper |
Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Some variants of the exponential formula, with application to the multivariate Tutte polynomial (alias Potts model)
Séminaire Lotharingien de Combinatoire | 2010-01-29 | Paper |
Some variants of the exponential formula, with application to the multivariate Tutte polynomial (alias Potts model)
Séminaire Lotharingien de Combinatoire | 2010-01-29 | Paper |
Uniform multicommodity flow through the complete graph with random edge-capacities
Operations Research Letters | 2009-11-17 | Paper |
| On the concentration of the chromatic number of random graphs | 2008-06-02 | Paper |
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization | 2008-05-14 | Paper |
Infinite Locally Random Graphs
Internet Mathematics | 2008-04-29 | Paper |
An LP-Designed Algorithm for Constraint Satisfaction
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Maximum directed cuts in acyclic digraphs
Journal of Graph Theory | 2007-06-11 | Paper |
Computational complexity of some restricted instances of 3-SAT
Discrete Applied Mathematics | 2007-04-13 | Paper |
On separating systems
European Journal of Combinatorics | 2007-04-10 | Paper |
Separating systems and oriented graphs of diameter two
Journal of Combinatorial Theory. Series B | 2007-02-13 | Paper |
Partitions and orientations of the Rado graph
Transactions of the American Mathematical Society | 2007-02-01 | Paper |
| Judicious partitions and related problems | 2007-01-19 | Paper |
Reconstructing under group actions.
Graphs and Combinatorics | 2007-01-05 | Paper |
| Discrepancy in graphs and hypergraphs | 2006-06-29 | Paper |
On Dependency Graphs and the Lattice Gas
Combinatorics, Probability and Computing | 2006-03-13 | Paper |
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Combinatorics, Probability and Computing | 2006-03-13 | Paper |
Reversals and Transpositions Over Finite Alphabets
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
Journal of Statistical Physics | 2005-08-08 | Paper |
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing | 2005-04-18 | Paper |
Judicious partitions of bounded‐degree graphs
Journal of Graph Theory | 2004-08-04 | Paper |
Finite Subsets of the Plane are 18-Reconstructible
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1787231 (Why is no real title available?) | 2003-07-17 | Paper |
A note on cycle lengths in graphs
Graphs and Combinatorics | 2003-03-25 | Paper |
Problems and results on judicious partitions
Random Structures & Algorithms | 2003-03-19 | Paper |
On induced subgraphs with all degree odd
Graphs and Combinatorics | 2002-01-09 | Paper |
Alternating knot diagrams, Euler circuits and the interlace polynomial
European Journal of Combinatorics | 2001-09-18 | Paper |
Subdivisions of transitive tournaments
European Journal of Combinatorics | 2001-08-02 | Paper |
On graph decompositions modulo \(k\)
Discrete Mathematics | 2001-01-02 | Paper |
Another simple proof of a theorem of Milner
Journal of Combinatorial Theory. Series A | 2000-06-04 | Paper |
Exact bounds for judicious partitions of graphs
Combinatorica | 2000-05-14 | Paper |
Judicious partitions of 3-uniform hypergraphs
European Journal of Combinatorics | 2000-04-26 | Paper |
Induced cycles and chromatic number
Journal of Combinatorial Theory. Series B | 1999-12-20 | Paper |
Reconstructing subsets of reals
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
Reconstructing subsets of reals
The Electronic Journal of Combinatorics | 1999-03-31 | Paper |
Reconstructing subsets of \(\mathbb{Z}_n\)
Journal of Combinatorial Theory. Series A | 1999-03-30 | Paper |
All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
Discrete Mathematics | 1998-07-06 | Paper |
Reconstructing sequences
Discrete Mathematics | 1998-06-29 | Paper |
Better bounds for perpetual gossiping
Discrete Applied Mathematics | 1998-03-10 | Paper |
Independent sets and repeated degrees
Discrete Mathematics | 1998-02-16 | Paper |
Judicious partitions of hypergraphs
Journal of Combinatorial Theory. Series A | 1998-01-28 | Paper |
| scientific article; zbMATH DE number 1002021 (Why is no real title available?) | 1997-04-22 | Paper |
A proof of a conjecture of Bondy concerning paths in weighted digraphs
Journal of Combinatorial Theory. Series B | 1996-10-14 | Paper |
Every tree contains a large induced subgraph with all degrees odd
Discrete Mathematics | 1995-09-28 | Paper |
Judicious partitions of graphs
Periodica Mathematica Hungarica | 1994-09-05 | Paper |
Large Induced Subgraphs with All Degrees Odd
Combinatorics, Probability and Computing | 1994-05-05 | Paper |
Induced subgraph density. I. A loglog step towards Erdos-Hajnal
(available as arXiv preprint) | N/A | Paper |
Induced subgraph density. III. Cycles and subdivisions
(available as arXiv preprint) | N/A | Paper |
Induced subgraphs density. IV. New graphs with the Erd\H{o}s-Hajnal property
(available as arXiv preprint) | N/A | Paper |
Induced subgraph density. VI. Bounded VC-dimension
(available as arXiv preprint) | N/A | Paper |
Reconstruction of shredded random matrices
(available as arXiv preprint) | N/A | Paper |
A counterexample to the coarse Menger conjecture
(available as arXiv preprint) | N/A | Paper |
Non-Homotopic Drawings of Multigraphs
(available as arXiv preprint) | N/A | Paper |
A note on graphs of k-colourings
(available as arXiv preprint) | N/A | Paper |
Lower bounds for graph reconstruction with maximal independent set queries
(available as arXiv preprint) | N/A | Paper |
