| Publication | Date of Publication | Type |
|---|
Proper edge colorings of planar graphs with rainbow \(C_4\)-s
Journal of Graph Theory | 2025-01-06 | Paper |
Large monochromatic components of small diameter
Journal of Graph Theory | 2023-10-04 | Paper |
Linear Turán numbers of acyclic triple systems
European Journal of Combinatorics | 2021-10-28 | Paper |
Monochromatic diameter-2 components in edge colorings of the complete graph
Involve | 2021-10-18 | Paper |
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
Journal of Combinatorics | 2019-11-18 | Paper |
A modified bootstrap percolation on a random graph coupled with a lattice
Discrete Applied Mathematics | 2019-03-22 | Paper |
Uniform hypergraphs containing no grids
Advances in Mathematics | 2014-01-08 | Paper |
Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
Journal of Graph Theory | 2012-06-13 | Paper |
| Long rainbow cycles in proper edge-colorings of complete graphs | 2011-11-22 | Paper |
Partitioning 3-colored complete graphs into three monochromatic cycles
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Three-color Ramsey numbers for paths
Combinatorica | 2009-07-20 | Paper |
Corrigendum. Three-color Ramsey numbers for paths
Combinatorica | 2009-01-20 | Paper |
Single-User Tracing and Disjointly Superimposed Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Large convex cones in hypercubes
Discrete Applied Mathematics | 2008-09-29 | Paper |
Tripartite Ramsey numbers for paths
Journal of Graph Theory | 2007-06-11 | Paper |
Large Convex Cones in Hypercubes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On the Maximum Size of (p, Q)—free Families
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Codes identifying sets of vertices in random networks
Discrete Mathematics | 2007-03-15 | Paper |
| One-sided coverings of colored complete bipartite graphs | 2007-03-05 | Paper |
| scientific article; zbMATH DE number 5130688 (Why is no real title available?) | 2007-03-05 | Paper |
Randomly generated intersecting hypergraphs II
Random Structures & Algorithms | 2007-02-07 | Paper |
An improved bound for the monochromatic cycle partition number
Journal of Combinatorial Theory. Series B | 2007-01-16 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
On randomly generated intersecting hypergraphs
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
Anti-Ramsey colorings in several rounds
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On the maximum size of \((p,Q)\)-free families
Discrete Mathematics | 2002-12-02 | Paper |
\(G\)-intersecting families
Combinatorics, Probability and Computing | 2002-11-24 | Paper |
Vertex covers by edge disjoint cliques
Combinatorica | 2002-02-13 | Paper |
| Decreasing the diameter of bounded degree graphs | 2000-12-19 | Paper |
A note on random minimum length spanning trees
The Electronic Journal of Combinatorics | 2000-09-14 | Paper |
A note on random minimum length spanning trees
The Electronic Journal of Combinatorics | 2000-09-14 | Paper |
A note on sparse random graphs and cover graphs
The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
A note on sparse random graphs and cover graphs
The Electronic Journal of Combinatorics | 2000-04-16 | Paper |
An improved upper bound of the rate of Euclidean superimposed codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
How to decrease the diameter of triangle-free graphs
Combinatorica | 1999-10-31 | Paper |
Short certificates for tournaments
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
Short certificates for tournaments
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
On a search problem in multidimensional grids
Journal of Statistical Planning and Inference | 1997-11-24 | Paper |
Intersecting Systems
Combinatorics, Probability and Computing | 1997-09-28 | Paper |
How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
IEEE Transactions on Information Theory | 1997-05-12 | Paper |
On a 2-dimensional search problem
Journal of Statistical Planning and Inference | 1995-01-31 | Paper |
On the upper bound of the size of the \(r\)-cover-free families
Journal of Combinatorial Theory. Series A | 1994-10-20 | Paper |
