Answers are grounded in this paper and cite their sources.
This paper continues the study of second-order signature properties—the characterization of the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform hypergraphs. However, the algorithm using this mechanism is extremely labor-intensive. The structure of the signature allows us to use it as a more efficient basis for the same problem. Here, we establish the nature of the mutual correspondence between the kind of second-order signature and extreme hypergraphs, and we present a new algorithm to find the power of the set of extreme 3-uniform hypergraphs through the set of their characteristic-signatures. New results obtained with the proposed tool are also presented.
No takes yet. Share an insight, caveat, or question.
Егорова et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: