{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:37Z","timestamp":1753893817605,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The hypergraph Ramsey number of two $3$-uniform hypergraphs $G$ and $H$, denoted by $R(G,H)$, is the least integer~$N$ such that every red-blue edge-coloring of the complete $3$-uniform hypergraph on $N$ vertices contains a red copy of $G$ or a blue copy of $H$. The Fano plane $\\mathbb{F}$ is the unique 3-uniform hypergraph with seven edges on seven vertices in which every pair of vertices is contained in a unique edge. There is a simple construction showing that $R(H,\\mathbb{F}) \\ge 2(v(H)-1) + 1.$\u00a0 Hypergraphs $H$ for which the equality holds are called $\\mathbb{F}$-good. Conlon asked to determine all $H$ that are $\\mathbb{F}$-good.In this short paper we make progress on this problem and prove that the tight path of length $n$ is $\\mathbb{F}$-good.<\/jats:p>","DOI":"10.37236\/8374","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:44:37Z","timestamp":1584578677000},"source":"Crossref","is-referenced-by-count":3,"title":["The Ramsey Number of Fano Plane Versus Tight Path"],"prefix":"10.37236","volume":"27","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix Christian","family":"Clemen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozef","family":"Skokan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam Zsolt","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,3,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p60\/8048","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p60\/8048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:44:38Z","timestamp":1584578678000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i1p60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,20]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/8374","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,3,20]]},"article-number":"P1.60"}}