{"id":"https://openalex.org/W2152535969","doi":"https://doi.org/10.1017/s0963548310000490","title":"Szemer\u00e9di's Regularity Lemma for Matrices and Sparse Graphs","display_name":"Szemer\u00e9di's Regularity Lemma for Matrices and Sparse Graphs","publication_year":2011,"publication_date":"2011-02-03","ids":{"openalex":"https://openalex.org/W2152535969","doi":"https://doi.org/10.1017/s0963548310000490","mag":"2152535969"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548310000490","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548310000490","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/476D84CD7176709E9559FEB36EB8BA62/S0963548310000490a.pdf/div-class-title-szemeredi-s-regularity-lemma-for-matrices-and-sparse-graphs-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":null,"license_id":null,"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":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/476D84CD7176709E9559FEB36EB8BA62/S0963548310000490a.pdf/div-class-title-szemeredi-s-regularity-lemma-for-matrices-and-sparse-graphs-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022035980","display_name":"Alex Scott","orcid":"https://orcid.org/0000-0003-0366-8404"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"ALEXANDER SCOTT","raw_affiliation_strings":["Mathematical Institute, 24-29 St Giles', Oxford, OX1 3LB, UK (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, 24-29 St Giles', Oxford, OX1 3LB, UK (e-mail:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5022035980"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1432,"has_fulltext":true,"cited_by_count":68,"citation_normalized_percentile":{"value":0.9604213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"3","first_page":"455","last_page":"466"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.9612321853637695},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6687919497489929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6502293348312378},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.6236157417297363},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49904870986938477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49869632720947266},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.28477469086647034},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18969619274139404}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.9612321853637695},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6687919497489929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6502293348312378},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.6236157417297363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49904870986938477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49869632720947266},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.28477469086647034},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18969619274139404},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548310000490","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548310000490","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/476D84CD7176709E9559FEB36EB8BA62/S0963548310000490a.pdf/div-class-title-szemeredi-s-regularity-lemma-for-matrices-and-sparse-graphs-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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0963548310000490","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548310000490","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/476D84CD7176709E9559FEB36EB8BA62/S0963548310000490a.pdf/div-class-title-szemeredi-s-regularity-lemma-for-matrices-and-sparse-graphs-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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2152535969.pdf","grobid_xml":"https://content.openalex.org/works/W2152535969.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W64270857","https://openalex.org/W79169851","https://openalex.org/W115873615","https://openalex.org/W621909926","https://openalex.org/W1978453013","https://openalex.org/W1997512277","https://openalex.org/W2116537669","https://openalex.org/W2141937899","https://openalex.org/W2153478982"],"related_works":["https://openalex.org/W2794535202","https://openalex.org/W2152535969","https://openalex.org/W2735923117","https://openalex.org/W115873615","https://openalex.org/W1518219880","https://openalex.org/W4297948573","https://openalex.org/W2115913661","https://openalex.org/W2951351945","https://openalex.org/W64270857","https://openalex.org/W3010450538"],"abstract_inverted_index":{"Szemer\u00e9di's":[0],"Regularity":[1,19,43,55],"Lemma":[2,20,44,56],"is":[3],"an":[4],"important":[5],"tool":[6],"for":[7,21,47,59],"analysing":[8],"the":[9,18,29],"structure":[10],"of":[11,17],"dense":[12],"graphs.":[13,49],"There":[14],"are":[15],"versions":[16],"sparse":[22,42],"graphs,":[23],"but":[24],"these":[25],"only":[26],"apply":[27],"when":[28],"graph":[30],"satisfies":[31],"some":[32],"local":[33],"density":[34],"condition.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39,52],"prove":[40],"a":[41,54],"that":[45,57],"holds":[46,58],"all":[48],"More":[50],"generally,":[51],"give":[53],"arbitrary":[60],"real":[61],"matrices.":[62]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}