Strong stability from vertex-extendability and applications in generalized Turán problems
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917688839766016 |
|---|---|
| author | Chen, Wanfang Liu, Xizhi |
| author_facet | Chen, Wanfang Liu, Xizhi |
| contents | Extending the work of Liu--Mubayi--Reiher~\cite{LMR23unif} on hypergraph Turán problems, we introduce the notion of vertex-extendability for general extremal problems on hypergraphs and develop an axiomatized framework for proving strong stability for extremal problems satisfying certain properties. This framework simplifies the typically complex and tedious process of obtaining stability and exact results for extremal problems into a much simpler task of verifying their vertex-extendability.
We present several applications of this method in generalized Turán problems including the Erdős Pentagon Problem, hypergraph Turán-goodness, and generalized Turán problems of hypergraphs whose shadow is complete multipartite. These results significantly strengthen and extend previous results of Erdős~\cite{Erdos62}, Győri--János--Simonovits~\cite{GPS91}, Grzesik~\cite{Gre12}, Hatami--Hladký--Kráľ--Norine--Razborov~\cite{HHKNR13}, Morrison--Nir--Norin--Rzążewski--Wesolek~\cite{MNNRPW23}, Gerbner--Palmer~\cite{GP22}, and others. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_05748 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Strong stability from vertex-extendability and applications in generalized Turán problems Chen, Wanfang Liu, Xizhi Combinatorics Extending the work of Liu--Mubayi--Reiher~\cite{LMR23unif} on hypergraph Turán problems, we introduce the notion of vertex-extendability for general extremal problems on hypergraphs and develop an axiomatized framework for proving strong stability for extremal problems satisfying certain properties. This framework simplifies the typically complex and tedious process of obtaining stability and exact results for extremal problems into a much simpler task of verifying their vertex-extendability. We present several applications of this method in generalized Turán problems including the Erdős Pentagon Problem, hypergraph Turán-goodness, and generalized Turán problems of hypergraphs whose shadow is complete multipartite. These results significantly strengthen and extend previous results of Erdős~\cite{Erdos62}, Győri--János--Simonovits~\cite{GPS91}, Grzesik~\cite{Gre12}, Hatami--Hladký--Kráľ--Norine--Razborov~\cite{HHKNR13}, Morrison--Nir--Norin--Rzążewski--Wesolek~\cite{MNNRPW23}, Gerbner--Palmer~\cite{GP22}, and others. |
| title | Strong stability from vertex-extendability and applications in generalized Turán problems |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.05748 |