scientific article; zbMATH DE number 3884215
From MaRDI portal
Publication:3218170
Recommendations
- Generalized octahedra and cliques in intersection graphs of uniform hypergraphs
- The Szemerédi-Petruska conjecture for a few small values
- Adding evidence to the Erdős-Faber-Lovász conjecture
- scientific article; zbMATH DE number 3724497
- scientific article; zbMATH DE number 54774
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Extension of a clique cover result to uniform hypergraphs
- Counting Small Cliques in 3-uniform Hypergraphs
- Degree sets of degree uniform graphs
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
Cited in
(13)- Critical hypergraphs and interesting set-pair systems
- t-expansive and t-wise intersecting hypergraphs
- Extension of a clique cover result to uniform hypergraphs
- On the representing number of intersecting families
- On the kernel of intersecting families
- On the maximum number of points in a maximal intersecting family of finite sets
- Maximal intersecting families and affine regular polygons in PG(2,q)
- Matchings and covers in hypergraphs
- Uniform intersecting families with covering number four
- The Szemerédi-Petruska conjecture for a few small values
- scientific article; zbMATH DE number 3634258 (Why is no real title available?)
- Matching criticality in intersecting hypergraphs
- Size, diversity, minimum degree, sturdiness, dömdödöm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3218170)
