combinatorial bounds 1fractional chromatic number 1graph cover number 1graph parameters 1local chromatic number 1
From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
Cover numbers by graph families bounded by certain graph parameters
Anna Gujgiczer, Márton Marits, Kenta Ozeki
The paper studies how many graphs from a family with bounded fractional or local chromatic number are needed to cover the edges of a given graph, proving that the classic exact for…
math.CO2026
Partitioning perfect graphs into comparability graphs
András Gyárfás, Márton Marits, Géza Tóth
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two…
math.CO2025
Cover numbers by certain graph families
Márton Marits
We define the cover number of a graph by a graph class as the minimum number of graphs of class required to cover the edge set of . Taking inspirat…