Takahiro Ueoro

collaborators

4 papers

math.CO2026

Extremal graphs with cycle lengths in a fixed residue class

Takahiro Ueoro

For integers $k \geq 3$ and $0 \leq ℓ < k$ , we call a graph $(ℓ mod k)$ -cycle-restricted if every cycle has length congruent to $ℓ$ modulo $k$ . Akbari, Jamaali, Mahmoody, and Se…

math.CO2026

A Sublinear Minimum-Degree Condition for $2$ -Connected Subgraphs of All Orders

Kenta Ozeki, Takahiro Ueoro

Motivated by an analogue of pancyclicity, we study minimum-degree conditions ensuring that a $2$ -connected graph $G$ of order $n$ contains a $2$ -connected subgraph of every order $…

math.CO2026

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$

Takahiro Ueoro

We study graphs containing no cycle whose length is divisible by $3$ or congruent to $4$ modulo $6$ . We prove that every such $n$ -vertex graph $G$ , where $n \geq 2$ , satisfies $e(G)…

math.CO2024

A note on the Erdős conjecture about square packing

Jineon Baek, Junnosuke Koizumi, Takahiro Ueoro

Let $f (n)$ denote the maximum total length of the sides of $n$ squares packed inside a unit square. Erdős conjectured that $f (k^{2} + 1) = k$ . We show that the conjecture is true if we a…

Extremal graphs with cycle lengths in a fixed residue class

A Sublinear Minimum-Degree Condition for 2-Connected Subgraphs of All Orders

On graphs without cycles of length 0 modulo 3 or 4 modulo 6

A note on the Erdős conjecture about square packing

A Sublinear Minimum-Degree Condition for $2$ -Connected Subgraphs of All Orders

On graphs without cycles of length $0$ modulo $3$ or $4$ modulo $6$