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 .
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.