Search arXivSearch

arXiv · 2505.05264

The Turan number of the balanced double star S_{n-1,n-1} in the hypercube Q_n

Abstract

The n-dimensional hypercube Q_n is a graph with vertex set {0,1}^n such that there is an edge between two vertices if and only if they differ in exactly one coordinate. Let H be a graph, and a graph is called H-free if it does not contain H as a subgraph. Given a graph H, the Turan number of H in Q_n, denoted by ex(Q_n, H), is the maximum number of edges of a subgraph of Q_n that is H-free. A double star S_{k,l} is the graph obtained by taking an edge uv and joining u with k vertices, v with l vertices which are different from the k vertices. We say a double star is a balanced double star if k = l. Currently, the Turan number of the balanced star S_{n,n} is has been studied in the planar graphs. In the hypercubes, the researchers look for the maximum number of edges of the graphs that are C_k-free. However, the Turan number of the double star in the hypercube remains unexplored. Building upon prior research, we initiate the first study on the Turan number of the balanced double star in the hypercube. In this paper, we give the exact value of the Turan number of the balanced double star S_{n-1,n-1} in the hypercube Q_n, which is 2^{n-3}*(4n- 3) for all n >= 3.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shoujun Xu, Dandan Liu. 2025-05-08. The Turan number of the balanced double star S_{n-1,n-1} in the hypercube Q_n. https://arxiv.org/abs/2505.05264

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO