<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>On the (k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7</dc:title>
   	<dc:creator>Glock, Stefan</dc:creator>
   	<dc:creator>Kim, Jaehoon</dc:creator>
   	<dc:creator>Lichev, Lyuben</dc:creator>
   	<dc:creator>Pikhurko, Oleg</dc:creator>
   	<dc:creator>Sun, Shumin</dc:creator>
   	<dc:subject>ddc:500</dc:subject>
   	<dc:description>Let f(r)(n;s,k) denote the maximum number of edges in an n-vertex r-uniform hypergraph containing no subgraph with k edges and at most s vertices. Brown, Erdős and Sós [New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan 1971), pp. 53--63, Academic Press 1973] conjectured that the limit limn→∞n−2f(3)(n;k+2,k) exists for all k. The value of the limit was previously determined for k=2 in the original paper of Brown, Erdős and Sós, for k=3 by Glock [Bull. Lond. Math. Soc. 51 (2019) 230--236] and for k=4 by Glock, Joos, Kim, Kühn, Lichev and Pikhurko [arXiv:2209.14177, accepted by Proc. Amer. Math. Soc.] while Delcourt and Postle [arXiv:2210.01105, accepted by Proc. Amer. Math. Soc.] proved the conjecture (without determining the limiting value).
In this paper, we determine the value of the limit in the Brown-Erdős-Sós Problem for k∈{5,6,7}. More generally, we obtain the value of limn→∞n−2f(r)(n;rk−2k+2,k) for all r≥3 and k∈{5,6,7}. In addition, by combining these new values with recent results of Bennett, Cushman and Dudek [arXiv:2309.00182] we obtain new asymptotic values for several generalised Ramsey numbers.</dc:description>
   	<dc:publisher>Cambridge University Press</dc:publisher>
   	<dc:date>2025</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:Article</dc:type>
   	<dc:type>Article</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/19017</dc:identifier>
   	<dc:source>Glock S, Kim J, Lichev L, Pikhurko O, Sun S. On the (k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7. &lt;i&gt;Canadian Journal of Mathematics&lt;/i&gt;. 2025:1-43. doi:&lt;a href=&quot;https://doi.org/10.4153/s0008414x25000021&quot;&gt;10.4153/s0008414x25000021&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.4153/s0008414x25000021</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0008-414X</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1496-4279</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/wos/001416788600001</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2403.04474</dc:relation>
   	<dc:rights>https://creativecommons.org/licenses/by/4.0/</dc:rights>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
