Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.09020

Induced rational exponents and bipartite subgraphs in $K_{s, s}$-free graphs

Zichao Dong·Jun Gao·Ruonan Li·Hong Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study a general phenomenon that many extremal results for bipartite graphs can be transferred to the induced setting when the host graph is $K_{s, s}$-free. As manifestations of this phenomenon, we prove that every rational $\frac{a}{b} \in (1, 2), \, a, b \in \mathbb{N}_+$, can be achieved as Turán exponent of a family of at most $2^a$ induced forbidden bipartite graphs, extending a result of Bukh and Conlon [JEMS 2018]. Our forbidden family is a subfamily of theirs which is substantially smaller. A key ingredient, which is yet another instance of this phenomenon, is supersaturation results for induced trees and cycles in $K_{s, s}$-free graphs. We also provide new evidence to a recent conjecture of Hunter, Milojević, Sudakov, and Tomon [JCTB 2025] by proving optimal bounds for the maximum size of $K_{s, s}$-free graphs without an induced copy of theta graphs or prism graphs, whose Turán exponents were determined by Conlon [BLMS 2019] and by Gao, Janzer, Liu, and Xu [IJM 2025+].

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zichao Dong, Jun Gao, Ruonan Li, Hong Liu. 2025-06-10. Induced rational exponents and bipartite subgraphs in $K_{s, s}$-free graphs. https://arxiv.org/abs/2506.09020

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↗