{"entities":{"Q7361219":{"pageid":31519196,"ns":120,"title":"Item:Q7361219","lastrevid":105364034,"modified":"2026-10-07T13:35:14Z","type":"item","id":"Q7361219","labels":{"en":{"language":"en","value":"Ramsey Number Bounds"}},"descriptions":{"en":{"language":"en","value":"AFP entry Ramsey_Bounds"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f0c5887984354ff23cac0d72681357bf30c7ca4f","datavalue":{"value":"https://isa-afp.org/entries/Ramsey_Bounds.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361219$77CBF62D-6E20-4F29-8AAD-28CAB1CBB8DC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cb302d03576a285f1f06085fb508f4d96fa60d9a","datavalue":{"value":{"time":"+2024-08-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361219$58A5EB98-DB9E-4A3C-B347-79471BEF17F2","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"7479166f83b44c07c9a493479bd3c0ed2c72ef23","datavalue":{"value":"Lawrence C. Paulson","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361219$1A1BF234-0117-41D2-BE59-095022168366","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"00bcf60bb122ce9ad26c24d26127c4581e6e4801","datavalue":{"value":{"text":"Ramsey Number Bounds","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361219$3259F74F-011B-4480-B12A-FC091EF3BEEB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ea8030c9d552b5626b0b60271b29f6f01c5205c0","datavalue":{"value":"Ramsey's theorem implies that for any given natural numbers $k$ and $l$, there exists some $R(k,l)$ such that a graph having at least $R(k,l)$ vertices must have either a clique of cardinality $k$ or an anticlique (independent set) of cardinality $l$. Equivalently, for a complete graph of size $R(k,l)$, every red/blue colouring of the edges must yield an entirely red $k$-clique or an entirely blue $l$-clique. Although $R(k,l)$ is for practical purposes impossible to calculate from $k$ and $l$, some upper and lower bounds are known. The celebrated probabilistic argument by Paul Erd\u0151s is formalised here, with various of its consequences.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361219$F811055C-45E7-4E77-8017-140BCD218C66","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"a2d5fae29fce4e1471763763841f1668768a93c2","datavalue":{"value":{"entity-type":"item","numeric-id":4198785,"id":"Q4198785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361219$BB1A3041-0683-4AB4-9E5B-DFD00B4BB658","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361219$91A3E485-BB76-4E0D-BB2D-FE55B1939230","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"4364ef645d61cdb1600e55c048bcbeb6b6b307a4","datavalue":{"value":{"entity-type":"item","numeric-id":7361238,"id":"Q7361238"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361219$147DED6F-6EC9-47C1-A3D6-1278EF8A6B98","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"5634edfbfbc0239093a6d080d47ef70273afec4d","datavalue":{"value":{"entity-type":"item","numeric-id":7360824,"id":"Q7360824"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361219$8CBDF9F0-E982-4569-9A93-4EC6524D7579","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361219$D46319B8-51F5-4207-8BDB-B3868AF3AACA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Ramsey Number Bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Ramsey_Number_Bounds"}}}}}