scientific article

From MaRDI portal

Revision as of 13:38, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3792687

Jump to:navigation, search

zbMath0648.05001MaRDI QIDQ3792687

Jean A. Larson, David A. Drake, Stephen J. Dow, Zoltan Fueredi

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

k-subsets k-clique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (10)

Embedding maximal cliques of sets in maximal cliques of bigger sets ⋮ More on maximal intersecting families of finite sets ⋮ A note on saturation for $k$-wise intersecting families ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited ⋮ The Binomial k‐Clique ⋮ Game saturation of intersecting families ⋮ Invitation to intersection problems for finite sets ⋮ Maximal intersecting families and affine regular polygons in \(PG(2,q)\) ⋮ Matchings and covers in hypergraphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3792687&oldid=17350622"