Loose Hamilton cycles in random uniform hypergraphs (Q540025): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Andrzej Dudek / rank | |||
Normal rank | |||
| Property / review text | |||
Summary: In the random \(k\)-uniform hypergraph \(H_{n,p;k}\) of order \(n\) each possible \(k\)-tuple appears independently with probability \(p\). A loose Hamilton cycle is a cycle of order \(n\) in which every pair of adjacent edges intersects in a single vertex. We prove that if \(pn^{k - 1}/ \log n\) tends to infinity with \(n\) then \(\lim_{n\to\infty } Pr(H_{n,p;k} \text{ contains a loose Hamilton cycle}) = 1\). This is asymptotically best possible. | |||
| Property / review text: Summary: In the random \(k\)-uniform hypergraph \(H_{n,p;k}\) of order \(n\) each possible \(k\)-tuple appears independently with probability \(p\). A loose Hamilton cycle is a cycle of order \(n\) in which every pair of adjacent edges intersects in a single vertex. We prove that if \(pn^{k - 1}/ \log n\) tends to infinity with \(n\) then \(\lim_{n\to\infty } Pr(H_{n,p;k} \text{ contains a loose Hamilton cycle}) = 1\). This is asymptotically best possible. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C80 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5902978 / rank | |||
Normal rank | |||
Revision as of 09:59, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Loose Hamilton cycles in random uniform hypergraphs |
scientific article |
Statements
Loose Hamilton cycles in random uniform hypergraphs (English)
0 references
1 June 2011
0 references
Summary: In the random \(k\)-uniform hypergraph \(H_{n,p;k}\) of order \(n\) each possible \(k\)-tuple appears independently with probability \(p\). A loose Hamilton cycle is a cycle of order \(n\) in which every pair of adjacent edges intersects in a single vertex. We prove that if \(pn^{k - 1}/ \log n\) tends to infinity with \(n\) then \(\lim_{n\to\infty } Pr(H_{n,p;k} \text{ contains a loose Hamilton cycle}) = 1\). This is asymptotically best possible.
0 references
