4 citations · 4 across the 2 of their papers we have counts for
4 papers
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…
Maximal independent sets in clique-free graphs
Xiaoyu He, Jiaxi Nie, Sam Spiro
Nielsen proved that the maximum number of maximal independent sets (MIS's) of size in an -vertex graph is asymptotic to , with the extremal construction a disjoint…
Ramsey Numbers for Non-trivial Berge Cycles
Jiaxi Nie, Jacques Verstraëte
In this paper, we consider an extension of cycle-complete graph Ramsey numbers to Berge cycles in hypergraphs: for , a {\em non-trivial Berge -cycle} is a family of se…
Triangle-free Subgraphs of Hypergraphs
Jiaxi Nie, Sam Spiro, Jacques Verstraete
In this paper, we consider an analog of the well-studied extremal problem for triangle-free subgraphs of graphs for uniform hypergraphs. A loose triangle is a hypergraph consis…