Mantel's theorem for random hypergraphs
Work
Year: 2016
Type: article
Abstract: A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of Kn is bipartite. A sparse version of Mantel's Theorem is that, for sufficient... more
Source: Random Structures and Algorithms
Institutions University of Illinois Urbana-Champaign, University of Victoria, University of Illinois Chicago
Cites: 16
Cited by: 5
Related to: 10
FWCI: 0.331
Citation percentile (by year/subfield): 53.86
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder National Security Agency
Grant ID H98230-13-1-0224