{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:24:30Z","timestamp":1772832270618,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>\r\nLet $G$ be a cancellative $3$-uniform hypergraph in which the symmetric difference of any two edges is not\r\ncontained in a third one. Equivalently, a $3$-uniform hypergraph $G$ is cancellative if and only if $G$ is\r\n$\\{F_4, F_5\\}$-free, where $F_4 = \\{abc, abd, bcd\\}$ and $F_5 = \\{abc, abd, cde\\}$. A classical result in\r\nextremal combinatorics stated that the maximum size of a cancellative hypergraph is achieved by the balanced\r\ncomplete tripartite $3$-uniform hypergraph, which was firstly proved by Bollob\u00e1s and later by Keevash and Mubayi. In this paper, we consider spectral extremal problems for cancellative hypergraphs. More precisely, we\r\ndetermine the maximum $p$-spectral radius of cancellative $3$-uniform hypergraphs, and characterize the\r\nextremal hypergraph. As a by-product, we give an alternative proof of Bollob\u00e1s' result from spectral viewpoint.\r\n<\/jats:p>","DOI":"10.37236\/12345","type":"journal-article","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T12:21:01Z","timestamp":1715862061000},"source":"Crossref","is-referenced-by-count":4,"title":["Spectral Tur\u00e1n-Type Problems on Cancellative Hypergraphs"],"prefix":"10.37236","volume":"31","author":[{"given":"Zhenyu","family":"Ni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lele","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2024,5,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i2p32\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i2p32\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T12:21:01Z","timestamp":1715862061000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i2p32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,17]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,4,5]]}},"URL":"https:\/\/doi.org\/10.37236\/12345","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,17]]},"article-number":"P2.32"}}