Quasi-random hypergraphs and spanning subhypergraph containment
Advancements in Network Statistics: extensions to HPC and hypergraphs.
| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Sao Paulo, Inst Matemat & Estat, BR-05508090 Sao Paulo - Brazil
[2] Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands - England
[3] Univ Warwick, DIMAP, Coventry CV4 7AL, W Midlands - England
[4] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands - England
Total Affiliations: 4
|
| Document type: | Journal article |
| Source: | RANDOM STRUCTURES & ALGORITHMS; v. 42, n. 1, p. 29-58, JAN 2013. |
| Web of Science Citations: | 2 |
| Abstract | |
This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turan's theorem, which deals with graphs G = ({[}n], E) such that no member of the restriction set R = (({[}n])(r)) induces a copy of K-r. Firstly, we examine what happens when this restriction set is replaced by R = [X is an element of (({[}n])(r)): X boolean AND {[}m] not equal empty set]. That is, we determine the maximal number of edges in an n-vertex such that no K-r hits a given vertex set. Secondly, we consider sparse random restriction sets. An r-uniform hypergraph R on vertex set {[}n] is called Turannical (respectively epsilon-Turannical), if for any graph G on {[}n] with more edges than the Turan number t(r)(n) (respectively (1+epsilon)t(r)(n)), no hyperedge of R induces a copy of K-r in G. We determine the thresholds for random r-uniform hypergraphs to be Turannical and to be epsilon-Turannical. Thirdly, we transfer this result to sparse random graphs, using techniques recently developed by Schacht {[}Extremal results for random discrete structures] to prove the Kohayakawa-Luczak-Rodl Conjecture on Turan's theorem in random graphs. (C) 2012 Wiley Periodicals, Inc. Random Struct. Alg., 42, 29-58, 2013 (AU) | |
| FAPESP's process: | 09/17831-7 - Embedding and packing problems in extremal graph theory |
| Grantee: | Julia Boettcher |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 10/09555-7 - Embedding, randomised and structural problems in extremal graph theory |
| Grantee: | Peter David Allen |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |