Showing 2025Show all
3 papers · 1 filter
math.CO2025
On Relative Ordered Turán Density
Dylan King, Bernard Lidický, Minghui Ouyang +3
For an ordered graph , denote the Turán density by . The relative Turán density, denoted by , is the supremum over such that every ordered graph …
math.CO2025
On the Turánability and tileability of oriented graphs
Igor Araujo, Zimu Xiang
An oriented graph is Turánable (resp. tileable) if there exist such that every semi-regular near-tournament on vertices contains a copy of …
math.CO2025
Results and Problems on Equitable Coloring of Graphs
H. A. Kierstead, Alexandr Kostochka, Zimu Xiang
A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themse…