{"id":"https://openalex.org/W1533346834","doi":"https://doi.org/10.37236/497","title":"An Entropy Proof of the Kahn-Lov\u00e1sz Theorem","display_name":"An Entropy Proof of the Kahn-Lov\u00e1sz Theorem","publication_year":2011,"publication_date":"2011-01-05","ids":{"openalex":"https://openalex.org/W1533346834","doi":"https://doi.org/10.37236/497","mag":"1533346834"},"language":"en","primary_location":{"id":"doi:10.37236/497","is_oa":true,"landing_page_url":"https://doi.org/10.37236/497","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p10/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":null,"license_id":null,"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/v18i1p10/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010808215","display_name":"Jonathan Cutler","orcid":null},"institutions":[{"id":"https://openalex.org/I166088655","display_name":"Montclair State University","ror":"https://ror.org/01nxc2t48","country_code":"US","type":"education","lineage":["https://openalex.org/I166088655"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Cutler","raw_affiliation_strings":["Montclair State University","Mathematical Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Montclair State University","institution_ids":["https://openalex.org/I166088655"]},{"raw_affiliation_string":"Mathematical Sciences","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032520716","display_name":"A. J. Radcliffe","orcid":"https://orcid.org/0000-0002-8817-0383"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. J. Radcliffe","raw_affiliation_strings":["University of Nebraska-Lincoln","#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2397,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84600998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","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.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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.9991999864578247,"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/mathematics","display_name":"Mathematics","score":0.8525217175483704},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7078925967216492},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6776719093322754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5205484628677368},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5152871608734131},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.5130511522293091},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4278455972671509},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3712666630744934},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19541513919830322},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.11206403374671936}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8525217175483704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7078925967216492},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6776719093322754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5205484628677368},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5152871608734131},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.5130511522293091},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4278455972671509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3712666630744934},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19541513919830322},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.11206403374671936},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.37236/497","is_oa":true,"landing_page_url":"https://doi.org/10.37236/497","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p10/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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:digitalcommons.unl.edu:mathfacpub-1142","is_oa":false,"landing_page_url":"https://digitalcommons.unl.edu/mathfacpub/144","pdf_url":null,"source":{"id":"https://openalex.org/S4306400577","display_name":"Lincoln (University of Nebraska)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114395901","host_organization_name":"University of Nebraska\u2013Lincoln","host_organization_lineage":["https://openalex.org/I114395901"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Mathematics: Faculty Publications","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.2107","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unl.edu/%7Earadcliffe1/Papers/kahnlovasz.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.598.9450","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.598.9450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.emis.de/journals/EJC/Volume_18/PDF/v18i1p10.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/497","is_oa":true,"landing_page_url":"https://doi.org/10.37236/497","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p10/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":null,"license_id":null,"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":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1533346834.pdf","grobid_xml":"https://content.openalex.org/works/W1533346834.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1834605046","https://openalex.org/W1951301781","https://openalex.org/W1986646471","https://openalex.org/W2039611200","https://openalex.org/W2052478317","https://openalex.org/W2052510900","https://openalex.org/W2146774612"],"related_works":["https://openalex.org/W1607894075","https://openalex.org/W2358696866","https://openalex.org/W2040035534","https://openalex.org/W2074972675","https://openalex.org/W113425656","https://openalex.org/W2064728122","https://openalex.org/W2949063304","https://openalex.org/W3122467016","https://openalex.org/W1491462073","https://openalex.org/W2736091028"],"abstract_inverted_index":{"Br\u00e8gman":[0],"gave":[1],"a":[2,14,43],"best":[3],"possible":[4],"upper":[5],"bound":[6],"for":[7],"the":[8,47],"number":[9],"of":[10,20,46,56],"perfect":[11],"matchings":[12],"in":[13,18],"balanced":[15],"bipartite":[16],"graph":[17],"terms":[19],"its":[21],"degree":[22],"sequence.":[23],"Recently":[24],"Kahn":[25],"and":[26],"Lov\u00e1sz":[27],"extended":[28],"Br\u00e8gman's":[29,60],"theorem":[30],"to":[31,41,58],"general":[32],"graphs.":[33],"In":[34],"this":[35],"paper,":[36],"we":[37],"use":[38,55],"entropy":[39,57],"methods":[40,51],"give":[42],"new":[44],"proof":[45],"Kahn-Lov\u00e1sz":[48],"theorem.":[49,61],"Our":[50],"build":[52],"on":[53],"Radhakrishnan's":[54],"prove":[59]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}