First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees

DOI10.1134/S1064230723040044MaRDI QIDQ6137205zbMATH OpenOpenAlexFDO

Authors T. Yu. Goltsova, E. K. Egorova, V. Yu. Leonov, A. V. Mokryakov

Publication date 18 January 2024

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064230723040044

zbMATH Keywords

adjacency matrices of extremal 3-uniform hypergraphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A class of hypergraphs and vertices of cut polytope relaxations
• Algorithm of multidimensional data transmission using extremal uniform hypergraphs
• Hypergraph recovery algorithms from a given vector of vertex degrees
• HYPERGRAPHS
• Hypergraphs as algebraic structures
• Minimax under transportation constraints
• On modeling city traffic systems with hypernetworks
• On the chromatic numbers of low-dimensional spaces
• 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
• Semantic limits of dense combinatorial objects
• Uniform generalized graphs

This page was built for publication: First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137205)