Signatures of extremal 2-unifrom hypergraphs

DOI10.1134/S1064230721060095zbMath1487.05187OpenAlexW4200077039MaRDI QIDQ2134319

A. V. Mokryakov, T. Yu. Goltsova, E. K. Egorova, Vladimir I. Tsurkov

Publication date: 3 May 2022

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

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

zbMATH Keywords

adjacency matrix\(n\)-vertex \(k\)-uniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Hypergraphs as algebraic structures
• The enumeration of connected graphs and linked diagrams
• Minimax under transportation constraints
• Uniform generalized graphs
• Hypergraph recovery algorithms from a given vector of vertex degrees
• Reconstructing 2-complexes by a nonnegative integer-valued vector
• On the number of edges in a uniform hypergraph with a range of permitted intersections
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Enumeration Of Labelled Graphs
• HYPERGRAPHS

This page was built for publication: Signatures of extremal 2-unifrom hypergraphs