Co-degree density of hypergraphs
Authors:
- Dhruv MubayiDMDhruv Mubayi
- Yi ZhaoYZYi Zhao
- 1 August 2007
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 114 (6) , 1118-1132
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Perfect matchings in uniform hypergraphs with large minimum degreeEuropean Journal of Combinatorics, 2006
- Matchings in hypergraphs of large minimum degreeJournal of Graph Theory, 2005
- On A Hypergraph Turán Problem Of FranklCombinatorica, 2005
- The Turan Density of Triple Systems Is Not PrincipalJournal of Combinatorial Theory, Series A, 2002
- On the jumping constant conjecture for multigraphsJournal of Combinatorial Theory, Series A, 1995
- Asymptotic solution of a turán-type problemGraphs and Combinatorics, 1990
- Algorithmic Solution of Extremal Digraph ProblemsTransactions of the American Mathematical Society, 1985
- Algorithmic solution of extremal digraph problemsTransactions of the American Mathematical Society, 1985
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structuresDiscrete Mathematics, 1984
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946