| Publication | Date of Publication | Type |
|---|
On the size-Ramsey number of grid graphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
The tree packing conjecture for trees of almost linear maximum degree
| 2021-06-22 | Paper |
On minimum bisection and related cut problems in trees and tree-like graphs
Journal of Graph Theory | 2018-10-31 | Paper |
Minimal Ramsey graphs for cyclicity
| 2018-07-31 | Paper |
Logical limit laws for minor-closed classes of graphs
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
Counting results for sparse pseudorandom hypergraphs. I.
European Journal of Combinatorics | 2017-08-31 | Paper |
Counting results for sparse pseudorandom hypergraphs. II.
European Journal of Combinatorics | 2017-08-31 | Paper |
An approximate version of the tree packing conjecture via random embeddings
| 2017-03-22 | Paper |
Approximating minimum \(k\)-section in trees with linear diameter
| 2016-10-17 | Paper |
A counting lemma for sparse pseudorandom hypergraphs
| 2016-10-17 | Paper |
On minimum bisection and related partition problems in graphs with bounded tree width
| 2016-10-14 | Paper |
Local resilience of spanning subgraphs in sparse random graphs
| 2016-10-14 | Paper |
An approximate version of the tree packing conjecture
Israel Journal of Mathematics | 2016-04-21 | Paper |
Spanning embeddings of arrangeable graphs with sublinear bandwidth
Random Structures & Algorithms | 2016-03-22 | Paper |
An extension of the blow-up lemma to arrangeable graphs
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
Ramsey numbers for bipartite graphs with small bandwidth
European Journal of Combinatorics | 2015-06-02 | Paper |
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
Discrete & Computational Geometry | 2015-02-03 | Paper |
On the bandwidth conjecture for \(3\)-colourable graphs
| 2014-12-18 | Paper |
scientific article; zbMATH DE number 6303002 (Why is no real title available?)
| 2014-06-11 | Paper |
scientific article; zbMATH DE number 6303009 (Why is no real title available?)
| 2014-06-11 | Paper |
scientific article; zbMATH DE number 6302982 (Why is no real title available?)
| 2014-06-11 | Paper |
Almost spanning subgraphs of random graphs after adversarial edge removal
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Supporting document to the paper "Logical limit laws for minor-closed classes of graphs"
| 2014-01-24 | Paper |
Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets
| 2013-11-01 | Paper |
Primality of trees
Journal of Combinatorics | 2013-07-30 | Paper |
Almost spanning subgraphs of random graphs after adversarial edge removal
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Bandwidth, treewidth, separators, expansion, and universality
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Perfect graphs of fixed density: counting and homogeneous sets
Combinatorics, Probability and Computing | 2012-09-12 | Paper |
Embedding into Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
European Journal of Combinatorics | 2010-06-17 | Paper |
Coloring Random Intersection Graphs and Complex Networks
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Proof of the bandwidth conjecture of Bollobás and Komlós
Mathematische Annalen | 2008-12-01 | Paper |
Diskrete Mathematik
| 2008-10-30 | Paper |
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
Embedding spanning subgraphs of small bandwidth
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
The random planar graph process
Random Structures & Algorithms | 2008-03-28 | Paper |
Essentially infinite colourings of hypergraphs
Proceedings of the London Mathematical Society | 2007-11-27 | Paper |
\(K_4\)-free subgraphs of random graphs revisited
Combinatorica | 2007-11-12 | Paper |
scientific article; zbMATH DE number 5158501 (Why is no real title available?)
| 2007-05-29 | Paper |
Efficiently covering complex networks with cliques of similar vertices
Theoretical Computer Science | 2006-04-28 | Paper |
Degree sequences of \(F\)-free graphs
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Large planar subgraphs in dense graphs
Journal of Combinatorial Theory. Series B | 2005-11-22 | Paper |
For which densities are random triangle-free graphs almost surely bipartite?
Combinatorica | 2004-09-07 | Paper |
Exact and approximative algorithms for coloring G(n,p)
Random Structures & Algorithms | 2004-08-06 | Paper |
On random planar graphs, the number of planar graphs and their triangulations
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
scientific article; zbMATH DE number 1962838 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1948237 (Why is no real title available?)
| 2003-07-10 | Paper |
Almost all graphs with high girth and suitable density have high chromatic number
Journal of Graph Theory | 2002-09-11 | Paper |
scientific article; zbMATH DE number 1775054 (Why is no real title available?)
| 2002-08-04 | Paper |
Phase transitions in the evolution of partial orders
Journal of Combinatorial Theory. Series A | 2002-06-02 | Paper |
Random maximalH-free graphs
| 2001-08-30 | Paper |
Asymptotic enumeration, global structure, and constrained evolution
Discrete Mathematics | 2001-07-24 | Paper |
Counting partial orders with a fixed number of comparable pairs
Combinatorics, Probability and Computing | 2001-07-18 | Paper |
Hypergraph Packing and Graph Embedding
Combinatorics, Probability and Computing | 2000-01-04 | Paper |
Randomized algorithms to generate hypergraphs with given degree sequences
| N/A | Paper |
