Abstract

Considering uniform hypergraphs, we prove that for every non-negative integer hh there exist two non-negative integers kk and tt with k≤tk\leq t such that two hh-uniform hypergraphs H{\mathcal H} and H′{\mathcal H}' on the same set VV of vertices, with ∣V∣≥t| V| \geq t, are equal up to complementation whenever H{\mathcal H} and H′{\mathcal H}' are kk-{hypomorphic up to complementation}. Let s(h)s(h) be the least integer kk such that the conclusion above holds and let v(h)v(h) be the least tt corresponding to k=s(h)k=s(h). We prove that s(h)=h+2⌊log⁡2h⌋s(h)= h+2^{\lfloor \log_2 h\rfloor} . In the special case h=2ℓh=2^{\ell} or h=2ℓ+1h=2^{\ell}+1, we prove that v(h)≤s(h)+hv(h)\leq s(h)+h. The values s(2)=4s(2)=4 and v(2)=6v(2)=6 were obtained in a previous work.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.