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 .
People also read lists articles that other readers of this article have read. Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine. Cited by lists all citing articles based on Crossref citations. Articles with the Crossref icon will open in a new tab.
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.