2 papers
math.CO2024
Odd Covers of Complete Graphs and Hypergraphs
Imre Leader, Ta Sheng Tan
The `odd cover number' of a complete graph is the smallest size of a family of complete bipartite graphs that covers each edge an odd number of times. For odd, Buchanan, Clifto…
math.CO2024
A Note on Graph Burning of Path Forests
Ta Sheng Tan, Wen Chean Teh
Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the…