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.CO2023
A Note on Hamiltonian-Intersecting Families of Graphs
Imre Leader, Žarko Ranđelović, Ta Sheng Tan
How many graphs on an -point set can we find such that any two have connected intersection? Berger, Berkowitz, Devlin, Doppelt, Durham, Murthy and Vemuri showed that the maximum…