Abstract
We answer a question of Sós by showing that, if a graph G of order n and density p
has no complete minor larger than would be found in a random graph G(n, p), then G is
quasi-random, provided either p > 0.45631 … or κ(G) [ges ] n(log log log n)/(log log n), where
0.45631 … is an explicit constant.The results proved can also be used to fill the gaps in an argument of Thomason,
describing the extremal graphs having no Kt minor for given t.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Crux, space constraints and subdivisions;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
2. On the extremal function for graph minors;Journal of Graph Theory;2022-02-28
3. A Lower Bound on the Average Degree Forcing a Minor;The Electronic Journal of Combinatorics;2020-04-03
4. The extremal function for disconnected minors;Journal of Combinatorial Theory, Series B;2017-09
5. σ-algebras for quasirandom hypergraphs;Random Structures & Algorithms;2016-06-08