Deepak Bal

activity

20112013

most citedOn Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2012

The t-tone chromatic number of random graphs

Deepak Bal, Patrick Bennett, Andrzej Dudek +1

A proper 2-tone $k$ -coloring of a graph is a labeling of the vertices with elements from $(2 [ k ])$ such that adjacent vertices receive disjoint labels and vertices distance…

math.CO2012

A greedy algorithm for finding a large 2-matching on a random cubic graph

Deepak Bal, Patrick Bennett, Tom Bohman +1

A 2-matching of a graph $G$ is a spanning subgraph with maximum degree two. The size of a 2-matching $U$ is the number of edges in $U$ and this is at least $n-\k(U)$ where $n$ is t…

math.CO2011

On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching

Deepak Bal, Andrzej Dudek, Zelealem B. Yilma

In this note, we determine the maximum number of edges of a $k$ -uniform hypergraph, $k \geq 3$ , with a unique perfect matching. This settles a conjecture proposed by Snevily.