2 citations · 4 across the 6 of their papers we have counts for
7 papers
Using Block Designs in Crossing Number Bounds
John Asplund, Eva Czabarka, Gregory Clark +6
The crossing number ${\mbox {cr}}(G)$ of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing…
New Perspectives on Neighborhood-Prime Labelings of Graphs
John Asplund, N. Bradley Fox, Arran Hamm
Neighborhood-prime labeling is a variation of prime labeling. A labeling is a neighborhood-prime labeling if for each vertex with degree greater t…
On the k-planar local crossing number
John Asplund, Thao do, Arran Hamm +1
Given a fixed positive integer , the -planar local crossing number of a graph , denoted by , is the minimum positive integer such that can be deco…
The k-planar crossing number of random graphs and random regular graphs
John Asplund, Thao Do, Arran Hamm +3
We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph . In particular, we show that the k-planar crossing number…
On Erdős-Ko-Rado for random hypergraphs I
Arran Hamm, Jeff Kahn
A family of sets is intersecting if no two of its members are disjoint, and has the Erdős-Ko-Rado property (or is EKR) if each of its largest intersecting subfamilies has nonempty…
On Erdős-Ko-Rado for random hypergraphs II
Arran Hamm, Jeff Kahn
Denote by the random -graph in which each -subset of is present with probability , independent of other choices. More or less answering…