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

DOI10.1134/s1064230723040044OpenAlexW4387231432MaRDI QIDQ6137205

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

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

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

Cites Work

• Hypergraphs as algebraic structures
• A class of hypergraphs and vertices of cut polytope relaxations
• On modeling city traffic systems with hypernetworks
• Minimax under transportation constraints
• Uniform generalized graphs
• On the number of independent sets in simple hypergraphs
• Algorithm of multidimensional data transmission using extremal uniform hypergraphs
• On the maximal cut in a random hypergraph
• On the number of edges of a uniform hypergraph with a range of allowed intersections
• Hypergraph recovery algorithms from a given vector of vertex degrees
• On the chromatic numbers of low-dimensional spaces
• Reconstructing 2-complexes by a nonnegative integer-valued vector
• On the concentration of the independence numbers of random hypergraphs
• HYPERGRAPHS
• Semantic limits of dense combinatorial objects

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