搜索结果: 1-2 共查到“组合数学 ITS”相关记录2条 . 查询时间(0.125 秒)
The size of a hypergraph and its matching number
hypergraph its matching number Combinatorics
2011/9/22
Abstract: More than forty years ago, Erd\H{o}s conjectured that for any T <= N/K, every K-uniform hypergraph on N vertices without T disjoint edges has at most max{\binom{KT-1}{K}, \binom{N}{K} - \bin...
Krausz dimension and its generalizations in special graph classes
Krausz dimension intersection graphs linear k-uniform hypergraphs chordal graphs polar graphs
2011/9/14
Abstract: A {\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ vertices in com...