{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:38Z","timestamp":1753893818061,"version":"3.41.2"},"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>In 1964, Erd\u0151s proved that for any $\\alpha &gt; 0$, an $l$-uniform hypergraph $G$ with $n \\geq n_0(\\alpha, l)$ vertices and $\\alpha \\binom{n}{l}$ edges contains a large complete $l$-equipartite subgraph. This implies that any sufficiently large $G$ with density $\\alpha &gt; 0$ contains a large subgraph with density at least $l!\/l^l$.In this note we study a similar problem for $l$-uniform hypergraphs $Q$ with a weak quasi-random property (i.e. with edges uniformly distributed over the sufficiently large subsets of vertices). We prove that any sufficiently large quasi-random $l$-uniform hypergraph $Q$ with density $\\alpha &gt; 0$ contains a large subgraph with density at least $\\frac{(l-1)!}{l^{l-1}-1}$. In particular, for $l=3$, any sufficiently large such $Q$ contains a large subgraph with density at least $\\frac{1}{4}$ which is the best possible lower bound.We define jumps for quasi-random sequences of $l$-graphs and our result implies that every number between 0 and $\\frac{(l-1)!}{l^{l-1}-1}$ is a jump for quasi-random $l$-graphs. For $l=3$ this interval can be improved based on a recent result of Glebov, Kr\u00e1l' and Volec. We prove that every number between [0, 0.3192) is a jump for quasi-random $3$-graphs.<\/jats:p>","DOI":"10.37236\/3222","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:31:41Z","timestamp":1578706301000},"source":"Crossref","is-referenced-by-count":3,"title":["Note on Upper Density of Quasi-Random Hypergraphs"],"prefix":"10.37236","volume":"20","author":[{"given":"Vindya","family":"Bhat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2013,6,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p59\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p59\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:18:37Z","timestamp":1579259917000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i2p59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,15]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,4,9]]}},"URL":"https:\/\/doi.org\/10.37236\/3222","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,6,15]]},"article-number":"P59"}}