A5102840605- Quantum chaos and dynamical systems
- Advanced Differential Equations and Dynamical Systems
- Photorefractive and Nonlinear Optics
- Matrix Theory and Algorithms
- Advanced Optical Imaging Technologies
- Advanced optical system design
Fuzhou University
2017-2024
Center for Discrete Mathematics and Theoretical Computer Science
2024
ABSTRACT Let be a family of ‐uniform hypergraphs (henceforth ‐graphs). An ‐saturated ‐graph is maximal not containing any member as subgraph. For integers , let the collection all ‐graphs with at most edges such that for some ‐set every pair covered by an edge in and complete ‐partite on vertices no two part sizes differing more than one. number . Our first result shows each contains subgraph vertices, which extends stability theorem graphs given Popielarz, Sahasrabudhe, Snyder. We also show...
For many well-known families of triple systems $\mathcal{M}$, there are perhaps near-extremal $\mathcal{M}$-free configurations that far from each other in edit-distance. Such a property is called non-stable and fundamental barrier to determining the Turán number $\mathcal{M}$. Liu Mubayi gave first finite example non-stable. In this paper, we construct another family $\mathcal{M}$ such two We also prove its Andrásfai-Erdős-Sós type stability theorem: Every system whose minimum degree close...