{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-G8POO6LG/D4126403-E47C-4706-86B2-D7482D2801B0/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-G8POO6LG/0a798830-2aaa-4b27-9336-6b9367845f26/PDF","dcterms:extent":"242 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-G8POO6LG/bde5cf3e-868e-4ec8-9afa-570fe7e59079/TEXT","dcterms:extent":"19 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-G8POO6LG","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2010","dc:creator":["DeVos, Matt","Kawarabayashi, Ken-ichi","Mohar, Bojan","Okamura, Haruko"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:3"},{"@xml:lang":"sl","#text":"str. 139-146"}],"dc:identifier":["COBISSID:15856473","ISSN:1855-3966","URN:URN:NBN:SI:doc-G8POO6LG"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"sl","#text":"matematika"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Immersing small complete graphs|"},"dc:description":{"@xml:lang":"sl","#text":"Following in the spirit of the Hadwiger and Hajós conjectures, Abu-Khzam and Langston have conjectured that every ?$k$?-chromatic graph contains an immersion of ?$K_k$?. They proved this for ?$k \\le 4$?. Much before that, Lescure and Meyniel F. Lescure and H. Meyniel, On a problem upon configurations contained in graphs with given chromatic number, Graph theory in memory of G.A. Dirac (Sandbjerg, 1985), 325-331, Ann. Discrete Math. 41, North-Holland, Amsterdam, 1989 obtained a stronger result that included also the values ?$k = 5$? and ?$6$?, by proving that every simple graph of minimum degree ?$k - 1$? contains an immersion of ?$K_k$?. They noted that they also have a proof of the same result for ?$k = 7$? but have not published it due to the length of the proof. We give a simple proof of this result. This, in particular, proves the conjecture of Abu-Khzam and Langston for every ?$k \\le 7$?"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-G8POO6LG","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-G8POO6LG"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-G8POO6LG/D4126403-E47C-4706-86B2-D7482D2801B0/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-G8POO6LG/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-G8POO6LG"}}}}