Linear paths and trees in uniform hypergraphs
Author:
- Zoltán FürediZFZoltán Füredi
- 1 December 2011
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 38, 377-382
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Linear paths and trees in uniform hypergraphsElectronic Notes in Discrete Mathematics, 2011
- Hypergraph Extensions of the Erdős-Gallai TheoremElectronic Notes in Discrete Mathematics, 2010
- Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphsJournal of Graph Theory, 2008
- Extremal k-edge-hamiltonian hypergraphsDiscrete Mathematics, 2008
- Hamiltonian chains in hypergraphsJournal of Graph Theory, 1999
- Exact solution of some Turán-type problemsJournal of Combinatorial Theory, Series A, 1987
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- On finite set-systems whose every intersection is a Kernel of a starDiscrete Mathematics, 1983
- On families of finite sets no two of which intersect in a singletonBulletin of the Australian Mathematical Society, 1977
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959