{"id":"https://openalex.org/W2007884657","doi":"https://doi.org/10.1017/s0963548312000430","title":"The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle","display_name":"The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle","publication_year":2012,"publication_date":"2012-10-19","ids":{"openalex":"https://openalex.org/W2007884657","doi":"https://doi.org/10.1017/s0963548312000430","mag":"2007884657"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000430","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000430","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/A5044704037","display_name":"Edward Marchant","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]},{"id":"https://openalex.org/I4210153325","display_name":"Institute of Mathematical Statistics","ror":"https://ror.org/043f04882","country_code":"US","type":"other","lineage":["https://openalex.org/I4210153325"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"EDWARD MARCHANT","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, UK (e-mail:","Department of pure mathematics and mathematical statistics, university of cambridge, centre for mathematical sciences, wilberforce road, cambridge cb3 0wb, uk e-mail: ejmarchant@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, UK (e-mail:","institution_ids":["https://openalex.org/I241749","https://openalex.org/I4210153325"]},{"raw_affiliation_string":"Department of pure mathematics and mathematical statistics, university of cambridge, centre for mathematical sciences, wilberforce road, cambridge cb3 0wb, uk e-mail: ejmarchant@gmail.com#TAB#","institution_ids":["https://openalex.org/I241749","https://openalex.org/I4210153325"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044704037"],"corresponding_institution_ids":["https://openalex.org/I241749","https://openalex.org/I4210153325"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07157964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"1","first_page":"112","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9983999729156494,"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/T10849","display_name":"Finite Group Theory Research","score":0.9912999868392944,"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/combinatorics","display_name":"Combinatorics","score":0.8265724182128906},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6930961608886719},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.6688652038574219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6589717268943787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6015700101852417},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4187222123146057},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4126170873641968},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4108760952949524},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19543808698654175}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8265724182128906},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6930961608886719},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.6688652038574219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6589717268943787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6015700101852417},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4187222123146057},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4126170873641968},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4108760952949524},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19543808698654175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548312000430","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000430","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W111038805","https://openalex.org/W1990008711","https://openalex.org/W2001029390","https://openalex.org/W2003132645","https://openalex.org/W2034645676","https://openalex.org/W2103078247","https://openalex.org/W2137756264","https://openalex.org/W2303867231","https://openalex.org/W4247935778","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2982283786","https://openalex.org/W4298388358","https://openalex.org/W4288436438","https://openalex.org/W1995383828","https://openalex.org/W2611288326","https://openalex.org/W1970462054","https://openalex.org/W2316246740","https://openalex.org/W2151291961","https://openalex.org/W2276107497","https://openalex.org/W4300822625"],"abstract_inverted_index":{"A":[0,20,27],"3-graph":[1,36],"is":[2,43,61,71,88],"said":[3],"to":[4,63],"contain":[5,51,97],"a":[6,35,52,98],"generalized":[7,53,99],"4-cycle":[8],"if":[9],"it":[10],"contains":[11],"4":[12,48],"edges":[13,49,92],"A,":[14],"B,":[15],"C,":[16],"D":[17,24],"such":[18,78],"that":[19,34,76],"\u2229":[21,23],"B=C":[22,29],"=\u2205":[25],"and":[26],"\u222a":[28,30],"D.":[31],"We":[32],"show":[33],"in":[37,45,73,90],"which":[38,94],"every":[39,84],"pair":[40,85],"of":[41,58,86],"vertices":[42,87],"contained":[44,89],"at":[46],"least":[47],"must":[50],"4-cycle.":[54,100],"When":[55],"the":[56,74],"number":[57],"vertices,":[59],"n,":[60],"equivalent":[62],"1":[64],"or":[65],"5":[66],"modulo":[67],"20,":[68],"this":[69],"result":[70],"optimum,":[72],"sense":[75],"for":[77],"n":[79],"there":[80],"are":[81],"3-graphs":[82],"where":[83],"3":[91],"but":[93],"do":[95],"not":[96]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}