Loose paths in random ordered hypergraphs

Dudek, Andrzej

doi:10.1016/j.dam.2026.04.020

Loose paths in random ordered hypergraphs

2026-08-15

0

PRE

AI

DOI：10.1016/j.dam.2026.04.020

原文链接

原文求助

摘要

En 中文

我们研究了随机r-均匀超图H = H-(r)(n, p)中有序松散路径的长度。有序松散路径是一个边序列E-1, E-2, ... , E-& ell;，其中对于1 <= i < & ell;，有max{j is an element of E-i} = min{j is an element of Ei+1}。我们确定了超图H中最长有序松散路径长度的高概率紧致界。(c) 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

Keyword:

Ordered loose paths

Random hypergraphs

Loose paths in random ordered hypergraphs

摘要

期刊

机构

引用论文