{"id":"https://openalex.org/W2170253147","doi":"https://doi.org/10.1017/s0963548307008565","title":"Regular Partitions of Hypergraphs: Counting Lemmas","display_name":"Regular Partitions of Hypergraphs: Counting Lemmas","publication_year":2007,"publication_date":"2007-07-31","ids":{"openalex":"https://openalex.org/W2170253147","doi":"https://doi.org/10.1017/s0963548307008565","mag":"2170253147"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548307008565","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548307008565","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109078443","display_name":"Vojt\u011bch R\u00f6dl","orcid":null},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"VOJT\u011aCH R\u00d6DL","raw_affiliation_strings":["Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail:","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048188412","display_name":"Mathias Schacht","orcid":"https://orcid.org/0000-0003-1762-4090"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MATHIAS SCHACHT","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany (e-mail:"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany (e-mail:","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109078443"],"corresponding_institution_ids":["https://openalex.org/I150468666"],"apc_list":null,"apc_paid":null,"fwci":8.5644,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.98559078,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"16","issue":"6","first_page":"887","last_page":"901"},"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.9980999827384949,"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/T10849","display_name":"Finite Group Theory Research","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6599551439285278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6058380007743835},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.41646263003349304},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4044116735458374}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6599551439285278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6058380007743835},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.41646263003349304},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4044116735458374}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548307008565","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548307008565","pdf_url":null,"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.217.4810","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.4810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.hu-berlin.de/~schacht/pub/2007/dense_reg2.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.hu-berlin.de:18452/22485","is_oa":false,"landing_page_url":"http://edoc.hu-berlin.de/18452/22485","pdf_url":null,"source":{"id":"https://openalex.org/S4306400923","display_name":"edoc Publication server (Humboldt University of Berlin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39343248","host_organization_name":"Humboldt-Universit\u00e4t zu Berlin","host_organization_lineage":["https://openalex.org/I39343248"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1568934558","https://openalex.org/W1899808675","https://openalex.org/W1977123275","https://openalex.org/W1995043396","https://openalex.org/W1996216417","https://openalex.org/W2058870462","https://openalex.org/W2059456505","https://openalex.org/W2080767775","https://openalex.org/W2085878382","https://openalex.org/W2092296749","https://openalex.org/W2093276208","https://openalex.org/W2093922095","https://openalex.org/W2149054878","https://openalex.org/W2149616758","https://openalex.org/W2477427859","https://openalex.org/W2528567371","https://openalex.org/W2950851250","https://openalex.org/W2952465979","https://openalex.org/W4247641533","https://openalex.org/W4251160190"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W3094179932","https://openalex.org/W3005801850","https://openalex.org/W2950595062"],"abstract_inverted_index":{"We":[0],"continue":[1],"the":[2,17],"study":[3],"of":[4,7,27],"regular":[5],"partitions":[6],"hypergraphs.":[8],"In":[9],"particular,":[10],"we":[11],"obtain":[12],"corresponding":[13],"counting":[14],"lemmas":[15,19],"for":[16,20],"regularity":[18],"hypergraphs":[21],"from":[22],"our":[23],"paper":[24],"\u2018Regular":[25],"Partitions":[26],"Hypergraphs:":[28],"Regularity":[29],"Lemmas\u2019":[30],"(in":[31],"this":[32],"issue).":[33]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}