A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
One of the first problems in extremal graph theory was the maximum number of edges that a triangle-free graph can have. Mantel solved this, which built the foundations of what we know as extremal graph theory. The natural progression was to ask the maximum number of edges in a k-book free graph. A k-book, denoted by B_k, is k triangles sharing a common edge. In the early 2000s, Győri solved the hypergraph analog of the maximum number of hyperedges in a triangle-free hypergraph. In a hypergraph,arXiv:2110.01184v1 fatcat:2wnugg6cqneyvhq6qndhfhnb6u