Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Sun, Lin"'
We investigate the occurrence of powers of tight Hamilton cycles in random hypergraphs. For every $r\ge 3$ and $k\ge 1$, we show that there exists a constant $C > 0$ such that if $p=p(n) \ge Cn^{-1/\binom{k+r-2}{r-1}}$ then asymptotically almost sure
Externí odkaz:
http://arxiv.org/abs/2310.18980
Autor:
Yu, Guanglong, Sun, Lin
For a $hypergraph$ $\mathcal{G}=(V, E)$ consisting of a nonempty vertex set $V=V(\mathcal{G})$ and an edge set $E=E(\mathcal{G})$, its $adjacency$ $matrix$ $\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}]$ is defined as $(\mathcal {A}_
Externí odkaz:
http://arxiv.org/abs/2306.16027
Autor:
Yu, Guanglong, Sun, Lin
For a $hypergraph$ $\mathcal{G}=(V, E)$ consisting of a nonempty vertex set $V=V(\mathcal{G})$ and an edge set $E=E(\mathcal{G})$, its $adjacency$ $matrix$ $\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}]$ is defined as $(\mathcal {A}_
Externí odkaz:
http://arxiv.org/abs/2306.10184
Let $Y_{3,2}$ be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph $ H $ on $ n $ vertices with at least $ \max \left \{ \binom{4\alpha n}{3}, \binom{n}{3}-\binom{n-\alpha n}{3} \right \}+o(n^3) $ edges contains a $
Externí odkaz:
http://arxiv.org/abs/2304.02432
Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$ vertex-di
Externí odkaz:
http://arxiv.org/abs/2109.00722
Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/1911.12542