The following pages link to Deepak Bal (Q344443):
Displaying 23 items.
- Lazy cops and robbers played on random graphs and graphs on surfaces (Q344444) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- On the maximum number of edges in a hypergraph with a unique perfect matching (Q409380) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- The \(t\)-tone chromatic number of random graphs (Q742618) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- New lower bounds on the size-Ramsey number of a path (Q2073313) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\) (Q2209894) (← links)
- Zero-forcing in random regular graphs (Q2226521) (← links)
- Power of \(k\) choices and rainbow spanning trees in random graphs (Q2256126) (← links)
- The total acquisition number of random graphs (Q2629497) (← links)
- On the size Ramsey number of all cycles versus a path (Q2659234) (← links)
- Rainbow matchings and Hamilton cycles in random graphs (Q2811161) (← links)
- Rainbow Arborescence in Random Digraphs (Q2833120) (← links)
- Packing Tight Hamilton Cycles in Uniform Hypergraphs (Q2910924) (← links)
- A greedy algorithm for finding a large 2‐matching on a random cubic graph (Q4581276) (← links)
- Rainbow perfect matchings and Hamilton cycles in the random geometric graph (Q4597602) (← links)
- A Ramsey property of random regular and k‐out graphs (Q5110662) (← links)
- A note on a candy sharing game (Q5151491) (← links)
- Large monochromatic components in hypergraphs with large minimum codegree (Q6144911) (← links)
- Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) (Q6195951) (← links)
- Full Degree Spanning Trees in Random Regular Graphs (Q6416835) (← links)
