Bogdan C. Dumitru

works on

computational verification 1 full binary trees 1 graceful labeling 1 graph packing 1 spider trees 1

From the 1 of 5 linked papers with an AI index.

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Alternating Extremes in Graceful Labelings of Full Binary Trees and Spider Trees

Bogdan Dumitru, Mihai Nacu

The paper studies a constrained graceful labeling where a deepest root‑to‑leaf path in full binary trees follows an alternating extreme pattern, proves this for comb trees and many…

math.CO2025

Notes on the 33-point ErdÅs--Szekeres problem

Bogdan Dumitru

The determination of $E S (7)$ is the first open case of the planar ErdÅs--Szekeres problem, where the general conjecture predicts $E S (7) = 33$ . We present a SAT encoding for the 33-p…

math.CO2025

Two-colorings of finite grids: variations on a theorem of Tibor Gallai

Bogdan Dumitru, Mihai Prunescu

A celebrated but non-effective theorem of Tibor Gallai states that for any finite set $A$ of $Z^{n}$ and for any finite number of colors $c$ there is a minimal $m$ such that no colo…

Alternating Extremes in Graceful Labelings of Full Binary Trees and Spider Trees

Notes on the 33-point ErdÅs--Szekeres problem

Two-colorings of finite grids: variations on a theorem of Tibor Gallai

Notes on the 33-point ErdÅs--Szekeres problem