Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
From MaRDI portal
Publication:6546362
Recommendations
- On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges
- Extremal problems in uniformly dense hypergraphs
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- scientific article; zbMATH DE number 3935081
- On the number of minimal transversals in 3-uniform hypergraphs
Cites work
- scientific article; zbMATH DE number 3480648 (Why is no real title available?)
- scientific article; zbMATH DE number 3609723 (Why is no real title available?)
- A class of hypergraphs and vertices of cut polytope relaxations
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
- Development of hypergraph theory
- Enumeration Of Labelled Graphs
- Extremal problems in hypergraph colourings
- Hypergraph recovery algorithms from a given vector of vertex degrees
- Hypergraphs as algebraic structures
- Minimax under transportation constraints
- On the concentration of the independence numbers of random hypergraphs
- On the maximal cut in a random hypergraph
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- On the number of independent sets in simple hypergraphs
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Signatures of extremal 2-unifrom hypergraphs
- Uniform generalized graphs
This page was built for publication: Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546362)
