REVIEW 1 cited by
\v{S}olt\'es' hypergraphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
More than $30$ years ago, \v{S}olt\'es observed that the total distance of the graph $C_{11}$ does not change by deleting a vertex, and wondered about the existence of other such graphs, called \v{S}olt\'es graphs. We extend the definition of \v{S}olt\'es' graphs to \v{S}olt\'es' hypergraphs, determine all orders for which a \v{S}olt\'es' hypergraph exists, observe infinitely many uniform \v{S}olt\'es' hypergraphs, and find the \v{S}olt\'es' hypergraph with minimum size (spoiler: it is not $C_{11}$).
Forward citations
Cited by 1 Pith paper
-
Uniform \v{S}olt\'es' hypergraphs and \v{S}olt\'es' weighted graphs
Uniform Šoltés' hypergraphs first occur at order 10, exist for every order n >= 10 and most uniformities k >= 4, a non-regular 9-uniform example exists, and infinitely many weighted Šoltés' graphs exist.
Discussion (0). Continue with ORCID to comment.