Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
The minimum positive co-degree of a nonempty -graph , denoted , is the maximum such that if is an -set contained in a hyperedge of , then is contained in at least distinct hyperedges of . Given an -graph , we introduce the positive co-degree Turán number as the maximum positive co-degree over all -vertex -graphs that do not contain as a subhypergraph. In this paper, we concentrate on the behavior of for 3-graphs .
Abstract In this note we examine the following random graph model: for an arbitrary graph H $H$ , with quadratic many edges, construct a graph G $G$ by randomly adding m $m$ edges to H $H$ and randomly coloring the edges of G $G$ with r $r$ colors. We show that for m $m$ a large enough constant and r ≥ 5 $r\ge 5$ , every pair of vertices in G $G$ are joined by a rainbow path, that is, G $G$ is rainbow connected, with high probability.
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.