3 papers
math.CO2026
Odd Edge Colorings of Graphs with Odd Order
Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
An {\em odd subgraph} of a graph is a subgraph in which every vertex has odd degree. A graph is said to be {\em odd -edge-colorable} if there exists an edge-coloring $E(G) \…
math.CO2026
Boolean lattice without small rainbow subposets
Gyula O. H. Katona, Yaping Mao, Kenta Ozeki +2
A Boolean lattice is the power set of an -element ground set equipped with inclusion relation. For two posets and , we…
math.CO2025
Ramsey numbers for partially-ordered sets
Gyula O. H. Katona, Yaping Mao, Kenta Ozeki +1
We say that a poset contains a copy (resp.~an induced copy) of a poset if there is an injection such that for any , in if (resp…