{"entities":{"Q2380230":{"pageid":2390973,"ns":120,"title":"Item:Q2380230","lastrevid":72652308,"modified":"2026-04-14T06:19:01Z","type":"item","id":"Q2380230","labels":{"en":{"language":"en","value":"Certificates of factorisation for a class of triangle-free graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5686778"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380230$9F295574-1283-4495-B975-85A67391D6ED","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"81a07ab0ca0aed45ddbc390a7f50d4a4cc1b94be","datavalue":{"value":{"text":"Certificates of factorisation for a class of triangle-free graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2380230$03CF0622-C234-4270-AF76-6EB0C5D756C8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c60348e7bb3f83b046a4ab4e1cd7783d1c106d82","datavalue":{"value":"1186.05057","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380230$8ECB893C-C73C-499D-AA34-D6D7BB1C35A6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7033e1540cad85d9c7a57e9538ddce0901452aa5","datavalue":{"value":{"entity-type":"item","numeric-id":405175,"id":"Q405175"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380230$B5ACE4D2-CF40-4162-8768-F234F82372D1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c10b05f408b175fc9b864bccc0f940febdbc4691","datavalue":{"value":{"entity-type":"item","numeric-id":810039,"id":"Q810039"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380230$7CEB3E61-E565-48C6-9B1D-AB9954D22C3E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ebc7441ecfd9ecfa38d48ddc4b2adb39ac7d7000","datavalue":{"value":{"entity-type":"item","numeric-id":161296,"id":"Q161296"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380230$51C872E1-61DB-4DBF-A4B7-ED730223DB29","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"143e8774a45e663375c24b3b343519cf2933b18c","datavalue":{"value":{"time":"+2010-03-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2380230$A7905A85-9952-4FB3-B883-FFB77A93FA17","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"641d1e955607cc36cdc4d6368fa07ef3ec6ccd03","datavalue":{"value":"https://eudml.org/doc/231824","type":"string"},"datatype":"url"},"type":"statement","id":"Q2380230$C39C2834-459D-400D-8CEE-F5E264783103","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"3bfa04769df87f8f4cfe9e0a8d061655456e191f","datavalue":{"value":"http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r75.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q2380230$57162540-BA68-4372-80C5-E24B96ECEC56","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9a93004b279a8e960003dcbd642a07ca1e20a30e","datavalue":{"value":"Summary: The chromatic polynomial \\(P(G,\\lambda)\\) gives the number of \\(\\lambda\\)-colourings of a graph. If \\(P(G,\\lambda)= P(H_1,\\lambda)P(H_2,\\lambda)/P(K_r,\\lambda)\\), then the graph \\(G\\) is said to have a chromatic factorisation with chromatic factors \\(H_1\\) and \\(H_2\\). It is known that the chromatic polynomial of any clique-separable graph has a chromatic factorisation. In this paper we construct an infinite family of graphs that have chromatic factorisations, but have chromatic polynomials that are not the chromatic polynomial of any clique-separable graph. A certificate of factorisation, that is, a sequence of rewritings based on identities for the chromatic polynomial, is given that explains the chromatic factorisations of graphs from this family. We show that the graphs in this infinite family are the only graphs that have a chromatic factorisation satisfying this certificate and having the odd cycle \\(C_{2n+1}\\), \\(n\\geq 2\\), as a chromatic factor.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2380230$DBC79114-CB67-4003-BB85-7F641458F738","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f15d46cb8d4ffe0dbd9357e013b784d0f700114","datavalue":{"value":"05C15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380230$CB7207DE-B5C5-4F3E-9173-1E7543D3593A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2fd5ba61c492f09082ae88370fa92e256be14e94","datavalue":{"value":"05C75","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380230$687C333A-5A95-492F-AC93-119FA0F604B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380230$5CEC679B-3ED3-4A3E-97EB-2E0588B6FE2B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7d1c31544f000064568d8bed620490ed0415a815","datavalue":{"value":"5686778","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380230$FC1C08C8-9DDE-4FFC-A40F-F6A55B9C9D53","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8d083cccdbcdb1e24d089fe7943900dd32ac84c4","datavalue":{"value":"chromatic polynomials","type":"string"},"datatype":"string"},"type":"statement","id":"Q2380230$8C6AB9BC-F4D8-4179-B118-6349989ECBF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b5d4aa68ec3ad6c06b825a81cb25a02fb89a299f","datavalue":{"value":"chromatic factorisation","type":"string"},"datatype":"string"},"type":"statement","id":"Q2380230$12881C4A-029B-416A-A129-53EA651F5F81","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2380230$10AF3A41-90F8-4DC1-9A29-0422A9ED0B92","rank":"normal"}],"P1633":[{"mainsnak":{"snaktype":"value","property":"P1633","hash":"cc3c0ddb2c9d2dfcc00bd5e5d8d297213b9b79ee","datavalue":{"value":"bafkreibx35muqqmaudlfrkvsbpswik7vmzd5g74jhme2qjajgpt5z6xe3q","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2380230$2E2C82F8-0EFB-49FD-B2E9-A41472FBEDE7","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2298267bcf523e4d506b797f8a49742d747d95d0","datavalue":{"value":{"entity-type":"item","numeric-id":2380229,"id":"Q2380229"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"06b9901133aaa13b1f35141737241ea39e05f261","datavalue":{"value":{"amount":"+0.933547854423523","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2380230$1676B2DC-820A-484D-987D-28804A8CBF4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"740485ea739381aeda6179f946eb1b1a6db78359","datavalue":{"value":{"entity-type":"item","numeric-id":409454,"id":"Q409454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4d2a893a1bfab8d36bb694de248488bf9a768cae","datavalue":{"value":{"amount":"+0.9141186475753784","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2380230$A952D2C2-8BDF-4D53-9C8A-6AACD295A827","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dc6e814ffa1387d30dd318a135479fae5e8a9b3a","datavalue":{"value":{"entity-type":"item","numeric-id":5298074,"id":"Q5298074"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"08e942746a767a0039f0e69318c569d19eefc641","datavalue":{"value":{"amount":"+0.753129780292511","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2380230$368F5944-9E26-4C0E-A4BE-754E6C70B51C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0423b50e2826c75a5f6c5bdc4823f8bb91f627e9","datavalue":{"value":{"entity-type":"item","numeric-id":5377353,"id":"Q5377353"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3325b712a53c8507eea6f0c76f1e9075f53a8c94","datavalue":{"value":{"amount":"+0.7488166093826294","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2380230$C041705D-B810-4F54-B776-CFFB0A00E68B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2fcfddd7b85b5a5cb9c13e63b0fe26b8003dd5a8","datavalue":{"value":{"entity-type":"item","numeric-id":405176,"id":"Q405176"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4189f6410e0bfeeec4b979a43f2972987d998a9c","datavalue":{"value":{"amount":"+0.7443731427192688","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2380230$60734C46-44C7-4BD9-9BAE-8D9386226F38","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Certificates of factorisation for a class of triangle-free graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Certificates_of_factorisation_for_a_class_of_triangle-free_graphs"}}}}}