Zobrazeno 1 - 10
of 272
pro vyhledávání: '"KAHN, JEFF"'
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 strong version of a second conjecture of Talagrand, on "selector processe
Externí odkaz:
http://arxiv.org/abs/2412.00917
Autor:
Dubroff, Quentin, Kahn, Jeff
The edge space $\mathcal{E}(G)$ of a graph $G$ is the vector space $\mathbb{F}_2^{E(G)}$ with members naturally identified with subgraphs of $G$, and the $H$-space is the subspace $\mathcal{C}_H(G)$ of $ \mathcal{E}(G)$ spanned by copies of the graph
Externí odkaz:
http://arxiv.org/abs/2410.06421
Autor:
Kahn, Jeff, Kenney, Charles
It is shown that the following holds for each $\varepsilon >0$. For $G$ an $n$-vertex graph of maximum degree $D$, lists $S_v$ ($v\in V(G)$), and $L_v$ chosen uniformly from the ($(1+\varepsilon)\ln n$)-subsets of $S_v$ (independent of other choices)
Externí odkaz:
http://arxiv.org/abs/2407.07928
Autor:
Kahn, Jeff, Kenney, Charles
It is shown that the following holds for each $\varepsilon>0$. For $G$ an $n$-vertex graph of maximum degree $D$ and "lists" $L_v$ ($v \in V(G)$) chosen independently and uniformly from the ($(1+\varepsilon)\ln n$)-subsets of $\{1, ..., D+1\}$, \[ G
Externí odkaz:
http://arxiv.org/abs/2306.00171
Autor:
Kahn, Jeff
We show that if ${\mathcal A},{\mathcal B},{\mathcal C}$ are increasing subsets of $\Omega:=\{0,1\}^n$ with ${\mathcal A}\neq\emptyset$, then with respect to any product probability measure on $\Omega$, \[ \mbox{if each of the pairs $\{{\mathcal A}\c
Externí odkaz:
http://arxiv.org/abs/2210.08653
Autor:
Dubroff, Quentin, Kahn, Jeff
Proving a 2009 conjecture of Itai Benjamini, we show: For any C there is an $\varepsilon>0$ such that for any simple graph $G$ on $V$ of size $n$, and $X_0,\ldots$ an ordinary random walk on $G$, $P(\{X_0,\dots, X_{Cn}\}= V) < e^{-\varepsilon n}.$ A
Externí odkaz:
http://arxiv.org/abs/2109.01237
We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional Expectation-Threshold Conje
Externí odkaz:
http://arxiv.org/abs/2105.10905
Resolving a conjecture of K\"uhn and Osthus from 2012, we show that $p= 1/\sqrt{n}$ is the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle.
Comment: 6 pages
Comment: 6 pages
Externí odkaz:
http://arxiv.org/abs/2010.08592
Autor:
Kahn, Jeff
For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from the $M$-subsets of ${\mathcal K}:={V \choose r}$ ($:= \{\m
Externí odkaz:
http://arxiv.org/abs/2008.01605
Autor:
Kahn, Jeff, Park, Jinyoung
A celebrated conjecture of Zs. Tuza says that in any (finite) graph, the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. Resolving a recent question of Bennett, Dudek, and Zerbib, w
Externí odkaz:
http://arxiv.org/abs/2007.04351