4 citations · 8 across the 23 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
On asymptotic packing of convex geometric and ordered graphs
Jiaxi Nie, Erlang Surya, Ji Zeng
A convex geometric graph is said to be packable if there exist edge-disjoint copies of in the complete convex geometric graph covering all but edges. We prov…
math.CO2022★ 1 cited
On Turán numbers for disconnected hypergraphs
Raffaella Mulas, Jiaxi Nie
We introduce the following simpler variant of the Turán problem: Given integers and , what is the smallest integer for which there exists an -uniform…
math.CO2022
Odd Covers of Graphs
Calum Buchanan, Alexander Clifton, Eric Culver +4
Given a finite simple graph , an odd cover of is a collection of complete bipartite graphs, or bicliques, in which each edge of appears in an odd number of bicliques and…