{"id":"https://openalex.org/W4407562073","doi":"https://doi.org/10.37236/12707","title":"A Proof of the $(n,k,t)$ Conjectures","display_name":"A Proof of the $(n,k,t)$ Conjectures","publication_year":2025,"publication_date":"2025-02-14","ids":{"openalex":"https://openalex.org/W4407562073","doi":"https://doi.org/10.37236/12707"},"language":"en","primary_location":{"id":"doi:10.37236/12707","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12707","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i1p22/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i1p22/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052175565","display_name":"Stacie Baumann","orcid":null},"institutions":[{"id":"https://openalex.org/I204593131","display_name":"College of Charleston","ror":"https://ror.org/00390t168","country_code":"US","type":"education","lineage":["https://openalex.org/I204593131"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stacie Baumann","raw_affiliation_strings":["College of Charleston"],"affiliations":[{"raw_affiliation_string":"College of Charleston","institution_ids":["https://openalex.org/I204593131"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054387266","display_name":"Joseph Briggs","orcid":"https://orcid.org/0000-0002-6919-5817"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Briggs","raw_affiliation_strings":["Auburn University"],"affiliations":[{"raw_affiliation_string":"Auburn University","institution_ids":["https://openalex.org/I82497590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052175565"],"corresponding_institution_ids":["https://openalex.org/I204593131"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05549655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":null,"last_page":null},"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.9894000291824341,"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.9894000291824341,"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.9891999959945679,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9853000044822693,"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/combinatorics","display_name":"Combinatorics","score":0.8316063284873962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7217047214508057},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6464789509773254},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5804042816162109},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.502720832824707},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.42448189854621887}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8316063284873962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7217047214508057},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6464789509773254},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5804042816162109},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.502720832824707},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.42448189854621887}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/12707","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12707","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i1p22/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/12707","is_oa":true,"landing_page_url":"https://doi.org/10.37236/12707","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i1p22/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309904","display_name":"Auburn University","ror":"https://ror.org/02v80fc35"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4407562073.pdf","grobid_xml":"https://content.openalex.org/works/W4407562073.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W3129272755","https://openalex.org/W2138685729","https://openalex.org/W2587900963","https://openalex.org/W2946244341"],"abstract_inverted_index":{"An":[0],"$(n,k,t)$-graph":[1],"is":[2,35],"a":[3,16],"graph":[4,27],"on":[5,18],"$n$":[6],"vertices":[7,14],"in":[8,24],"which":[9],"every":[10],"set":[11],"of":[12,26,40,51,58,69],"$k$":[13],"contains":[15],"clique":[17],"$t$":[19,55],"vertices.":[20],"Tur\u00e1n's":[21,63],"Theorem,":[22],"rephrased":[23],"terms":[25],"complements,":[28],"states":[29],"that":[30,44],"the":[31],"unique":[32],"minimum":[33,45],"$(n,k,2)$-graph":[34],"an":[36],"equitable":[37],"disjoint":[38,49],"union":[39],"cliques.":[41],"We":[42],"prove":[43],"$(n,k,t)$-graphs":[46],"are":[47],"always":[48],"unions":[50],"cliques":[52],"for":[53],"any":[54],"(despite":[56],"nonuniqueness":[57],"extremal":[59],"examples),":[60],"thereby":[61],"generalizing":[62],"Theorem":[64],"and":[65],"confirming":[66],"two":[67],"conjectures":[68],"Hoffman":[70],"et":[71],"al.":[72]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}