{"id":"https://openalex.org/W2062639285","doi":"https://doi.org/10.1305/ndjfl/1040149357","title":"Expansions of Ultrahomogeneous Graphs","display_name":"Expansions of Ultrahomogeneous Graphs","publication_year":1995,"publication_date":"1995-07-01","ids":{"openalex":"https://openalex.org/W2062639285","doi":"https://doi.org/10.1305/ndjfl/1040149357","mag":"2062639285"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1040149357","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040149357","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-3/Expansions-of-Ultrahomogeneous-Graphs/10.1305/ndjfl/1040149357.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-3/Expansions-of-Ultrahomogeneous-Graphs/10.1305/ndjfl/1040149357.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059044036","display_name":"J. E. Helmreich","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. E. Helmreich","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059044036"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18985593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.994700014591217,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.994700014591217,"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.9937000274658203,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9345999956130981,"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/unary-operation","display_name":"Unary operation","score":0.7835745811462402},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.7736473679542542},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6744375228881836},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5750994086265564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5139093399047852},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41876816749572754},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.41316357254981995},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4107288122177124},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3629147410392761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34454959630966187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31430166959762573},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13657429814338684}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7835745811462402},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7736473679542542},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6744375228881836},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5750994086265564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5139093399047852},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41876816749572754},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.41316357254981995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4107288122177124},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3629147410392761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34454959630966187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31430166959762573},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13657429814338684}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1040149357","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040149357","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-3/Expansions-of-Ultrahomogeneous-Graphs/10.1305/ndjfl/1040149357.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1040149357","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1040149357","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1040149357","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040149357","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-3/Expansions-of-Ultrahomogeneous-Graphs/10.1305/ndjfl/1040149357.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2062639285.pdf","grobid_xml":"https://content.openalex.org/works/W2062639285.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1561798411","https://openalex.org/W1993345408","https://openalex.org/W2036680937","https://openalex.org/W2089544611","https://openalex.org/W4206556490"],"related_works":["https://openalex.org/W3172619790","https://openalex.org/W2035456572","https://openalex.org/W2085054174","https://openalex.org/W2059675826","https://openalex.org/W603403972","https://openalex.org/W1554245510","https://openalex.org/W2152638828","https://openalex.org/W2061237693","https://openalex.org/W3121955789","https://openalex.org/W1578113210"],"abstract_inverted_index":{"Lachlan":[0],"and":[1],"Woodrow":[2],"have":[3],"completly":[4],"classified":[5],"the":[6,12],"countable":[7],"ultrahomogeneous":[8,26,30],"graphs.":[9],"We":[10],"expand":[11],"language":[13],"of":[14,29],"graphs":[15,31],"to":[16],"include":[17],"a":[18],"new":[19],"unary":[20],"predicate.":[21],"In":[22],"this":[23],"expanded":[24],"language,":[25],"vertex":[27],"2-colorings":[28],"are":[32],"classified.":[33]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}