Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
From MaRDI portal
Publication:6546362
DOI10.1134/S1064230723050039zbMATH Open1540.05128MaRDI QIDQ6546362FDOQ6546362
Authors: I. S. Beretskii, E. K. Egorova, A. V. Mokryakov, V. I. Tsurkov 
Publication date: 29 May 2024
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
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
- On the concentration of the independence numbers of random hypergraphs
- Hypergraphs as algebraic structures
- Uniform generalized graphs
- Title not available (Why is that?)
- A class of hypergraphs and vertices of cut polytope relaxations
- Minimax under transportation constraints
- Reconstructing 2-complexes by a nonnegative integer-valued vector
- Enumeration Of Labelled Graphs
- Development of hypergraph theory
- Hypergraph recovery algorithms from a given vector of vertex degrees
- On the maximal cut in a random hypergraph
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
- On the number of independent sets in simple hypergraphs
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Extremal problems in hypergraph colourings
- Signatures of extremal 2-unifrom hypergraphs
- Title not available (Why is that?)
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)
