Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.03948

Hypergraphs with infinitely many extremal constructions

Jianfeng Hou·Heng Li·Xizhi Liu·Dhruv Mubayi·Yixiao Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give the first exact and stability results for a hypergraph Turán problem with infinitely many extremal constructions that are far from each other in edit-distance. This includes an example of triple systems with Turán density $2/9$, thus answering some questions posed by the third and fourth authors and Reiher about the feasible region of hypergraphs. Our results also provide extremal constructions whose shadow density is a transcendental number. Our novel approach is to construct certain multilinear polynomials that attain their maximum (in the standard simplex) on a line segment and then to use these polynomials to define an operation on hypergraphs that gives extremal constructions.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianfeng Hou, Heng Li, Xizhi Liu, Dhruv Mubayi, Yixiao Zhang. 2023-11-30. Hypergraphs with infinitely many extremal constructions. https://arxiv.org/abs/2206.03948

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗