{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:42:57Z","timestamp":1753893777411,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A 3-graph is a pair H = (V, E) of sets, where elements of V are called points or vertices and E contains some 3-element subsets of V , called edges. A 3-graph is called linear if any two distinct edges intersect in at most one vertex.There is a recent interest in extremal properties of 3-graphs containing no crown, three pairwise disjoint edges and a fourth edge which intersects all of them. We show that every linear 3-graph with minimum degree 4 contains a crown. This is not true if 4 is replaced by 3.<\/jats:p>","DOI":"10.37236\/11037","type":"journal-article","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T08:25:19Z","timestamp":1666340719000},"source":"Crossref","is-referenced-by-count":0,"title":["Crowns in Linear $3$-Graphs of Minimum Degree $4$"],"prefix":"10.37236","volume":"29","author":[{"given":"Alvaro","family":"Carbonero","sequence":"first","affiliation":[]},{"given":"Willem","family":"Fletcher","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"additional","affiliation":[]},{"given":"Rona","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shiyu","family":"Yan","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2022,10,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i4p17\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i4p17\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T08:25:20Z","timestamp":1666340720000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i4p17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,21]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,10,6]]}},"URL":"https:\/\/doi.org\/10.37236\/11037","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2022,10,21]]},"article-number":"P4.17"}}