Robert Seiver

Learn More
A k-uniform linear path of length l, denoted by P (k) l , is a family of k-sets {F1, . . . , Fl} such that |Fi ∩ Fi+1| = 1 for each i and Fi ∩ Fj = ∅ whenever |i − j| > 1. Given a k-uniform hypergraph H and a positive integer n, the k-uniform hypergraph Turán number of H , denoted by exk(n,H), is the maximum number of edges in a k-uniform hypergraph F on n(More)
Given a positive integer n and a graph F , the Turán number ex(n, F ) is the maximum number of edges in an n-vertex simple graph that does not contain F as a subgraph. Let H be a graph and p a positive even integer. Let H(p) denote the graph obtained from H by subdividing each of its edges p−1 times. We prove that ex(n,H(p)) = O(n1+(16/p)). This follows(More)
  • 1