Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Yevgenya Movshovich
Barbara Aquilani
Sipeng Li
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
yuri rabinovicht
Home
/
Author
/
DEEPAK BAL
Author Info
Open Visualization
Name
Affiliation
Papers
DEEPAK BAL
The Ohio State University, Department of Mathematics, 100 Mathematics Building, 231 West 18th Avenue, Columbus, OH 43210-1174, USA
16
Collaborators
Citations
PageRank
21
35
7.32
Referers
Referees
References
74
172
115
Search Limit
100
172
Publications (16 rows)
Collaborators (21 rows)
Referers (74 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
New lower bounds on the size-Ramsey number of a path
0
0.34
2022
Hamiltonian Berge Cycles In Random Hypergraphs
0
0.34
2021
A Ramsey property of random regular and k‐out graphs
0
0.34
2020
Partitioning random graphs into monochromatic components
4
0.74
2017
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
0
0.34
2017
Rainbow matchings and Hamilton cycles in random graphs.
7
0.66
2016
Rainbow Arborescence in Random Digraphs
0
0.34
2016
The Total Acquisition Number of Random Graphs
0
0.34
2016
Power of k Choices and Rainbow Spanning Trees in Random Graphs.
1
0.41
2015
Lazy Cops and Robbers on Hypercubes
5
0.67
2015
The t-Tone Chromatic Number of Random Graphs
1
0.40
2014
Packing Tree Factors in Random and Pseudo-random Graphs.
0
0.34
2014
Packing Tight Hamilton Cycles in Uniform Hypergraphs.
7
0.69
2012
A greedy algorithm for finding a large 2-matching on a random cubic graph
1
0.36
2012
On the maximum number of edges in a hypergraph with a unique perfect matching
1
0.37
2011
Graph connectivity, partial words, and a theorem of Fine and Wilf
8
0.65
2008
1