92 citations · 106 across the 20 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.CO2024
On odd covers of cliques and disjoint unions
Calum Buchanan, Alexander Clifton, Eric Culver +5
Babai and Frankl posed the ``odd cover problem" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order…
math.CO2024
Positroid envelopes and graphic positroids
Jeremy Quail, Puck Rombach
Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope cla…
math.CO2024★ 1 cited
A lower bound on the saturation number and a strengthening for triangle-free graphs
Calum Buchanan, Puck Rombach
The saturation number of a graph and positive integer is the minimum size of a graph of order which does not contain a subgraph isomorphic to…