Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.15978

A note on the rainbow Turán number of brooms with length 2 handles

Anastasia Halfpap
View original source ↗Read source document ↗Export metadata ↓

Abstract

For a fixed graph $F$, the rainbow Turán number $\mathrm{ex^*}(n,F)$ is the largest number of edges possible in an $n$-vertex graph which admits a rainbow-$F$-free proper edge-coloring. We focus on the rainbow Turán numbers of trees obtained by appending some number of pendant edges to one end of a length 2 path; we call such a tree with $k$ total edges a $k$-edge broom with length $2$ handle, denoted by $B_{k,2}$. Study of $\mathrm{ex^*}(n,B_{k,2})$ was initiated by Johnston and Rombach, who claimed a proof asymptotically establishing the value of $\mathrm{ex^*}(n,B_{k,2})$ for all $k$. We correct an error in this original argument, identifying two small cases in which the value claimed in the literature is incorrect; in all other cases, we recover the originally claimed value. Our argument also characterizes the extremal constructions for $\mathrm{ex^*}(n,B_{k,2})$ for certain congruence classes of $n$ modulo $k$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasia Halfpap. 2025-12-17. A note on the rainbow Turán number of brooms with length 2 handles. https://arxiv.org/abs/2512.15978

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗