6 papers · 1 filter
Thresholds vs. expectation thresholds for non-spanning graphs
Quentin Dubroff
The threshold for the event that the binomial random graph contains a copy of a graph is the unique for which , an…
On Minimum Cost Rainbow Structures
Patrick Bennett, Quentin Dubroff, Alan Frieze +1
We discuss the expected minimum cost of rainbow spanning trees and Hamilton cycles in randomly edge colored random graphs.
On the "second" Kahn--Kalai Conjecture: cliques, cycles, and trees
Quentin Dubroff, Jeff Kahn, Jinyoung Park
We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hope…
On the "second" Kahn--Kalai Conjecture
Quentin Dubroff, Jeff Kahn, Jinyoung Park
We make progress on a conjecture of Kahn and Kalai, the original (stronger but less general) version of what became known as the ``Kahn-Kalai Conjecture" (KKC; now a theorem of Par…
Note on a conjecture of Talagrand: expectation thresholds vs. fractional expectation thresholds
Quentin Dubroff, Jeff Kahn, Jinyoung Park
We show that a restricted version of a conjecture of M. Talagrand on the relation between "expectation thresholds" and "fractional expectation thresholds" follows easily from a str…
On the -space of a random graph
Quentin Dubroff, Jeff Kahn
The edge space of a graph is the vector space with members naturally identified with subgraphs of , and the -space is the subspace…