{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:01:47Z","timestamp":1769155307569,"version":"3.49.0"},"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>In 2020, Coregliano and Razborov introduced a general framework to study limits of combinatorial objects, using logic and model theory. They introduced the abstract chromatic number and proved\/reproved multiple Erd\u0151s-Stone-Simonovits-type theorems in different settings. In 2022, Coregliano extended this by showing that similar results hold when we count copies of $K_t$ instead of edges.\r\nOur aim is threefold. First, we provide a purely combinatorial approach. Second, we extend their results by showing several other graph parameters and other settings where Erd\u0151s-Stone-Simonovits-type theorems follow. Third, we go beyond determining asymptotics and obtain corresponding stability, supersaturation, and sometimes even exact results.<\/jats:p>","DOI":"10.37236\/13541","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:52:46Z","timestamp":1769100766000},"source":"Crossref","is-referenced-by-count":0,"title":["On Tur\u00e1n-Type Problems and the Abstract Chromatic Number"],"prefix":"10.37236","volume":"33","author":[{"given":"D\u00e1niel","family":"Gerbner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilal","family":"Hama Karim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Kucheriya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2026,1,23]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p19\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p19\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:52:46Z","timestamp":1769100766000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i1p19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,23]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/13541","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,23]]},"article-number":"P1.19"}}