26 citations · 106 across the 27 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Unavoidable hypergraphs
M. Bucić, N. Draganić, B. Sudakov +1
The following very natural problem was raised by Chung and Erdős in the early 80's and has since been repeated a number of times. What is the minimum of the Turán number $\text{ex}…
math.CO2020
Two problems in graph Ramsey theory
Tuan Tran
We study two problems in graph Ramsey theory. In the early 1970's, Erdős and O'Neil considered a generalization of Ramsey numbers. Given integers and with $n \ge k \ge…
math.PR2020★ 6 cited
The smallest singular value of random combinatorial matrices
Tuan Tran
Let be a random matrix with entries in whose rows are independent vectors of exactly zero components. We show that the smallest singular value $s_…