{"id":"https://openalex.org/W2345403094","doi":"https://doi.org/10.1007/s00493-016-3436-4","title":"Infinitely connected subgraphs in graphs of uncountable chromatic number","display_name":"Infinitely connected subgraphs in graphs of uncountable chromatic number","publication_year":2016,"publication_date":"2016-05-09","ids":{"openalex":"https://openalex.org/W2345403094","doi":"https://doi.org/10.1007/s00493-016-3436-4","mag":"2345403094"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-016-3436-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-016-3436-4","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/2a40e941-8bd7-4f9b-a41c-48dc0495fc2e","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062275812","display_name":"Carsten Thomassen","orcid":"https://orcid.org/0000-0003-0670-4079"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Carsten Thomassen","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark, DK-2800, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, DK-2800, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062275812"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04421357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"4","first_page":"785","last_page":"793"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9984999895095825,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9972000122070312,"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/uncountable-set","display_name":"Uncountable set","score":0.9897582530975342},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8473266959190369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8097190856933594},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5721210241317749},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5481151342391968},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.5469286441802979},{"id":"https://openalex.org/keywords/critical-graph","display_name":"Critical graph","score":0.5119096040725708},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5017940998077393},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1840282678604126},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08803242444992065},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.05448201298713684}],"concepts":[{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.9897582530975342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8473266959190369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8097190856933594},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5721210241317749},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5481151342391968},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.5469286441802979},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.5119096040725708},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5017940998077393},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1840282678604126},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08803242444992065},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.05448201298713684}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00493-016-3436-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-016-3436-4","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/2a40e941-8bd7-4f9b-a41c-48dc0495fc2e","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/2a40e941-8bd7-4f9b-a41c-48dc0495fc2e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thomassen , C 2016 , ' Infinitely connected subgraphs in graphs of uncountable chromatic number ' , Combinatorica , vol. 37 , no. 4 , pp. 785\u2013793 . https://doi.org/10.1007/s00493-016-3436-4","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/2a40e941-8bd7-4f9b-a41c-48dc0495fc2e","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/2a40e941-8bd7-4f9b-a41c-48dc0495fc2e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thomassen , C 2016 , ' Infinitely connected subgraphs in graphs of uncountable chromatic number ' , Combinatorica , vol. 37 , no. 4 , pp. 785\u2013793 . https://doi.org/10.1007/s00493-016-3436-4","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1971010887","https://openalex.org/W1987592722","https://openalex.org/W2013589923","https://openalex.org/W2015708878","https://openalex.org/W2087986857","https://openalex.org/W2098621549","https://openalex.org/W2129846869","https://openalex.org/W2167749725","https://openalex.org/W4250699352"],"related_works":["https://openalex.org/W2950817880","https://openalex.org/W2087986857","https://openalex.org/W1987592722","https://openalex.org/W2345403094","https://openalex.org/W2052878613","https://openalex.org/W2562183448","https://openalex.org/W2168180506","https://openalex.org/W2049992750","https://openalex.org/W1984098916","https://openalex.org/W3178681420"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}