Tootfinder

The maximum number of triangles in $K_{1,s,t}$-free graphs
Asier Calbet, Ritesh Goenka
https://arxiv.org/abs/2508.10611 https://arxiv.org/pdf/2508.10611

The maximum number of triangles in $K_{1,s,t}$-free graphs
We consider the following generalized Turán problem: For $2 \le s \le t$, what is the maximum number of triangles in a $K_{1,s,t}$-free graph on $n$ vertices? The previously best known lower and upper bounds are $Ω(n^2)$ and $o(n^{3-1/s})$, respectively. To the best of our knowledge, all known proofs of the upper bound use the triangle removal lemma. We give a new elementary proof that avoids the use of the triangle removal lemma and improves the upper bound to $O\left(n^{3-1/s}(\log n)^{-1+1…

This https://arxiv.org/abs/2504.21059 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

A remark on the number of automorphisms of some algebraic structures
In these notes we look at the following question. Given a category $\mathcal C$ of algebraic structure (e.g. the category of groups, monoids, partial groups, ...) and a rational $r\in \mathbb Q$, does there exists an element $x\in \mathcal C$ such that the size of its automorphism group $\text{Aut}_{\mathcal C} (x)$ divided by the size of $x$ (whatever that would means) is equal to $r$\,? To our knowledge, this question was introduced by Tărnăuceanu in the category of groups. Here, we answer …