Filter Results:
- Full text PDF available (13)
Publication Year
2008
2018
- This year (2)
- Last 5 years (12)
- Last 10 years (18)
Publication Type
Co-author
Journals and Conferences
Learn More
- Deepak Bal, Alan M. Frieze
- SIAM J. Discrete Math.
- 2011
Consider a 3-uniform hypergraph <i>H</i> with <i>n</i> vertices. A tight Hamilton cycle <i>C</i> ⊂ <i>H</i> is a collection of <i>n</i> edges for which there is an ordering of the vertices… (More)
- Deepak Bal, Alan M. Frieze
- Random Struct. Algorithms
- 2016
Let HPn,m,k be drawn uniformly from all m-edge, k-uniform, k-partite hypergraphs where each part of the partition is a disjoint copy of [n]. We let HP (κ) n,m,k be an edge colored version, where we… (More)
- Deepak Bal, Anthony Bonato, Bill Kinnersley, Pawel Pralat
- Combinatorics, Probability & Computing
- 2015
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we… (More)
- Deepak Bal, Louis DeBiasio
- Electr. J. Comb.
- 2017
Erdős, Gyárfás, and Pyber (1991) conjectured that every r-colored complete graph can be partitioned into at most r − 1 monochromatic components; this is a strengthening of a conjecture of Lovász… (More)
- Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
- Discrete Mathematics
- 2011
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k ≥ 3, with a unique perfect matching. This settles a conjecture proposed by Snevily.
- Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia
- Inf. Comput.
- 2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string searching and pattern… (More)
- Deepak Bal, Patrick Bennett, Alan M. Frieze, Pawel Pralat
- Electr. J. Comb.
- 2015
We consider the Erdős-Rényi random graph process, which is a stochastic process that starts with n vertices and no edges, and at each step adds one new edge chosen uniformly at random from the set of… (More)
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we… (More)
- Deepak Bal, Patrick Bennett, Colin S Cooper, Alan M. Frieze, Pawel Pralat
- Journal of Graph Theory
- 2016
We consider the Erdős-Rényi random directed graph process, which is a stochastic process that starts with n vertices and no edges, and at each step adds one new directed edge chosen uniformly at… (More)
- Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze
- Graphs and Combinatorics
- 2014
A proper 2-tone k-coloring of a graph is a labeling of the vertices with elements from ( [k] 2 ) such that adjacent vertices receive disjoint labels and vertices distance 2 apart receive distinct… (More)