Turán Numbers for Forests of Paths in Hypergraphs
Work
Year: 2014
Type: article
Abstract: The Turán number of an $r$-uniform hypergraph $H$ is the maximum number of edges in any $r$-graph on $n$ vertices which does not contain $H$ as a subgraph. Let $\mathcal{P}_{\ell}^{(r)}$ denote the fa... more
Authors Neal Bushaw, Nathan Kettle
Institutions Arizona State University, University of Cambridge
Cites: 21
Cited by: 15
Related to: 10
FWCI: 2.232
Citation percentile (by year/subfield): 90.32
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Sustainable Development Goal Life on land
Open Access status: green