1 citations · 2 across the 8 of their papers we have counts for
10 papers · 1 filter
The Saturation Spectrum of Berge Stars
Neal Bushaw, Sean English, Emily Heath +2
The forbidden subgraph problem is among the oldest in extremal combinatorics -- how many edges can an -vertex -free graph have? The answer to this question is the well-studie…
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…
Toughness of recursively partitionable graphs
Calum Buchanan, Brandon Du Preez, K. E. Perry +1
A simple graph on vertices is said to be recursively partitionable (RP) if , or if is connected and satisfies the following recursive property: for…
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…
Symmetry Parameters of Various Hypercube Families
Debra Boutin, Sally Cockburn, Lauren Keough +2
In this paper we study the symmetry parameters determining number, distinguishing number, and cost of 2-distinguishing, for some variations on hypercubes, namely Hamming graphs, po…
Symmetry Parameters for Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
The Mycielskian construction, denoted , takes a finite simple graph to a larger graph with of the same clique number but larger chromatic number. The generalized Mycielsk…