Bounds on the number of edges in hypertrees

DOI10.1016/J.DISC.2016.01.004zbMath1334.05093arXiv1404.6430OpenAlexW287260819MaRDI QIDQ279202

Péter G. N. Szabó, Gyula Y. Katona

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6430

zbMATH Keywords

hypertreecycle in hypergraphpath in hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (4)

Asymptotic sharpness of bounds on hypertrees ⋮ Unnamed Item ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ On efficiently solvable cases of quantum \(k\)-SAT

Cites Work

• Unnamed Item
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Hamiltonian chains in hypergraphs

This page was built for publication: Bounds on the number of edges in hypertrees