Canadian Journal of Mathematics , volume=

A theorem on k-saturated graphs , author= · 1965

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2026-04-23 · unverdicted · novelty 8.0

For any c<1, k≥3 and t≥1 there exist k-uniform hypergraphs with maximum clique size >c|V| whose maximum cliques cannot be pierced by t vertices.

Showing 1 of 1 citing paper.

Piercing all maximum cliques in hypergraphs math.CO · 2026-04-23 · unverdicted · none · ref 2
For any c<1, k≥3 and t≥1 there exist k-uniform hypergraphs with maximum clique size >c|V| whose maximum cliques cannot be pierced by t vertices.