{"id":"https://openalex.org/W4386458224","doi":"https://doi.org/10.1017/s0963548323000263","title":"Forcing generalised quasirandom graphs efficiently","display_name":"Forcing generalised quasirandom graphs efficiently","publication_year":2023,"publication_date":"2023-09-05","ids":{"openalex":"https://openalex.org/W4386458224","doi":"https://doi.org/10.1017/s0963548323000263"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548323000263","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548323000263","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D7E760183F9FBE00D96D2721DB83C87C/S0963548323000263a.pdf/div-class-title-forcing-generalised-quasirandom-graphs-efficiently-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D7E760183F9FBE00D96D2721DB83C87C/S0963548323000263a.pdf/div-class-title-forcing-generalised-quasirandom-graphs-efficiently-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034742583","display_name":"Andrzej Grzesik","orcid":"https://orcid.org/0000-0003-2770-7180"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Andrzej Grzesik","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Jagiellonian University, Krakw, Poland,","Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Jagiellonian University, Krakw, Poland,","institution_ids":["https://openalex.org/I126596746"]},{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Jagiellonian University, Krak\u00f3w, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027559065","display_name":"Daniel Kr\u00e1l\u034f\u030c","orcid":"https://orcid.org/0000-0001-8680-0890"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Daniel Kr\u00e1l\u2019","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080095759","display_name":"Oleg Pikhurko","orcid":"https://orcid.org/0000-0002-9657-4011"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Oleg Pikhurko","raw_affiliation_strings":["Mathematics Institute and DIMAP, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Mathematics Institute and DIMAP, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080095759"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.6745,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61787262,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"33","issue":"1","first_page":"16","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7632715702056885},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6093770265579224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6051005721092224},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.568347692489624},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.5646253228187561},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5229029059410095},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5174649357795715},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.48772677779197693},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4462067186832428},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4315425455570221},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3497239947319031},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3318917751312256},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09687426686286926}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7632715702056885},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6093770265579224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6051005721092224},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.568347692489624},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.5646253228187561},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5229029059410095},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5174649357795715},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.48772677779197693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4462067186832428},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4315425455570221},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3497239947319031},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3318917751312256},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09687426686286926},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548323000263","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548323000263","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D7E760183F9FBE00D96D2721DB83C87C/S0963548323000263a.pdf/div-class-title-forcing-generalised-quasirandom-graphs-efficiently-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:177550","is_oa":true,"landing_page_url":"https://wrap.warwick.ac.uk/177550/1/WRAP-forcing-generalized-quasirandom-graphs-efficiently-Pikhurko-2023.pdf","pdf_url":"https://wrap.warwick.ac.uk/177550/7/forcing-generalised-quasirandom-graphs-efficiently.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/326043","is_oa":true,"landing_page_url":"http://ruj.uj.edu.pl/bitstreams/f4eb564e-d87a-4d9e-98d9-1e6163a2f2ca/download","pdf_url":null,"source":{"id":"https://openalex.org/S4306401249","display_name":"Jagiellonian University Repository (Jagiellonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126596746","host_organization_name":"Jagiellonian University","host_organization_lineage":["https://openalex.org/I126596746"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s0963548323000263","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548323000263","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D7E760183F9FBE00D96D2721DB83C87C/S0963548323000263a.pdf/div-class-title-forcing-generalised-quasirandom-graphs-efficiently-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4311618646","display_name":null,"funder_award_id":"MUNI/I/1677/2018","funder_id":"https://openalex.org/F4320326548","funder_display_name":"Masarykova Univerzita"},{"id":"https://openalex.org/G4475798705","display_name":null,"funder_award_id":"RPG-2018-424","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"},{"id":"https://openalex.org/F4320326548","display_name":"Masarykova Univerzita","ror":"https://ror.org/02j46qs45"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386458224.pdf","grobid_xml":"https://content.openalex.org/works/W4386458224.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W49228565","https://openalex.org/W273178449","https://openalex.org/W1533473741","https://openalex.org/W1561387090","https://openalex.org/W1883408324","https://openalex.org/W1966460832","https://openalex.org/W1970138544","https://openalex.org/W1984080039","https://openalex.org/W1995043396","https://openalex.org/W2005430465","https://openalex.org/W2053631808","https://openalex.org/W2059456505","https://openalex.org/W2065307939","https://openalex.org/W2066050841","https://openalex.org/W2079810243","https://openalex.org/W2082734581","https://openalex.org/W2115076673","https://openalex.org/W2127355117","https://openalex.org/W2134984950","https://openalex.org/W2147310610","https://openalex.org/W2149054878","https://openalex.org/W2153710291","https://openalex.org/W2160519701","https://openalex.org/W2479413759","https://openalex.org/W2616204030","https://openalex.org/W2811492944","https://openalex.org/W2892188524","https://openalex.org/W2901284226","https://openalex.org/W2911324645","https://openalex.org/W2912205456","https://openalex.org/W2962962954","https://openalex.org/W2963467977","https://openalex.org/W2991990030","https://openalex.org/W2998740364","https://openalex.org/W3046477764","https://openalex.org/W3082325971","https://openalex.org/W3084987570","https://openalex.org/W3102552432","https://openalex.org/W3105754508","https://openalex.org/W3127383814","https://openalex.org/W3183382846","https://openalex.org/W3204583332","https://openalex.org/W3213081841","https://openalex.org/W4251160190","https://openalex.org/W6600971645","https://openalex.org/W6631953675"],"related_works":["https://openalex.org/W603403972","https://openalex.org/W4361825306","https://openalex.org/W2898526288","https://openalex.org/W3123003473","https://openalex.org/W2170819362","https://openalex.org/W2031276298","https://openalex.org/W1554245510","https://openalex.org/W2607123191","https://openalex.org/W3013958983","https://openalex.org/W1769730578"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"generalised":[3,88],"quasirandom":[4,89],"graphs":[5,33,55,62,76,90,101],"whose":[6],"vertex":[7],"set":[8],"consists":[9],"of":[10,28,53,61,87,100,125],"$q$":[11],"parts":[12,29,94,112],"(of":[13],"not":[14],"necessarily":[15],"the":[16,36,51,71,85,123],"same":[17],"sizes)":[18],"with":[19,63,77,91,102],"edges":[20],"within":[21],"each":[22,26],"part":[23],"and":[24,43,47],"between":[25],"pair":[27],"distributed":[30],"quasirandomly;":[31],"such":[32,54],"correspond":[34],"to":[35,73,128],"stochastic":[37],"block":[38],"model":[39],"studied":[40],"in":[41,110],"statistics":[42],"network":[44],"science.":[45],"Lov\u00e1sz":[46,69],"S\u00f3s":[48],"showed":[49],"that":[50,75,84],"structure":[52,86],"is":[56,95],"forced":[57,96],"by":[58,97],"homomorphism":[59,98],"densities":[60,99],"at":[64,103],"most":[65,104],"$(10q)^q+q$":[66],"vertices;":[67],"subsequently,":[68],"refined":[70],"argument":[72],"show":[74],"$4(2q+3)^8$":[78],"vertices":[79,109,118],"suffice.":[80,119],"Our":[81],"results":[82],"imply":[83],"$q\\ge":[92],"2$":[93],"$4q^2-q$":[105],"vertices,":[106],"and,":[107],"if":[108],"distinct":[111,114],"have":[113],"degrees,":[115],"then":[116],"$2q+1$":[117],"The":[120],"latter":[121],"improves":[122],"bound":[124],"$8q-4$":[126],"due":[127],"Spencer.":[129]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2023-09-06T00:00:00"}