Flow certificates, weighted averages and coloured graphs
VectorPaint two-colour complete graphs: six force a monochromatic triangle, five can avoid one
Use six vertices/fifteen edges and a five-vertex/ten-edge control to verify R(3,3)=6, distinguishing completeness, monochromatic triples and drawing crossings.
On this page
Colour every edge between distinct vertices exactly red or blue and ask whether a triangle with all three edges one colour is forced. One coloured example proves no universal claim, and a V missing its third edge is not a triangle. Prove six sufficient, then use a five-vertex counterexample to show five insufficient; both establish the minimum six.
Build a complete graph with six vertices and fifteen edges
Number vertices zero through five, with one edge per unordered pair, no loops, duplicate edges or directions: 6×5/2=15 edges. On about 2000 × 1600 pixels use a near-hexagonal layout for labels, without encoding lengths. Group vertices, full edges, colours, proof and five-point control, then save. Check five neighbours per vertex, including long diagonals. Every edge must have exactly one red/blue category; uncoloured or doubly coloured edges change the problem. Drawing crossings add no vertices.
Find three same-colour neighbours among five incident edges
Choose vertex zero. Among its five incident edges, at least one of two colours occurs three or more times: two of each would give at most four. Suppose red has at least three and select neighbours one, two and three; interchange colours if blue is the majority. This guarantees only those three edges from zero, not the edges among the neighbours. Emphasise the chosen edges while retaining the other two, rather than deleting unselected neighbours and redefining the graph as a four-vertex input.
Split the three neighbours into two exhaustive cases
Inspect edges 1–2,1–3,2–3. If any is red, say 1–2, then 0–1,0–2,1–2 form a red triangle. If none is red, all three are blue, giving blue triangle 1–2–3. These exhaustive cases prove that every six-vertex colouring contains at least one monochromatic triangle, not exactly one or necessarily one through zero. The second case excludes zero. Three red spokes from zero alone are not a triangle; all three edges between a triple are required.
Draw one checkable example without substituting it for proof
Use red edges 01,02,03,12 and eleven remaining blue edges, still fifteen total. Highlight red triangle 012 after checking its three edges. This illustrates the universal proof; it does not force the same 012 in every colouring. In a checking copy make 12,13,23 blue while keeping 01,02,03 red, revealing blue triangle 123. Recolour without changing the edge set and update old highlights. A triangle may cross other drawing lines; do not count enclosed little faces as graph triangles.
Show a five-vertex red cycle and blue cycle without triangles
In a separate complete graph on zero through four, colour 01,12,23,34,04 red, a five-cycle, and 02,03,13,14,24 blue. Blue also forms cycle 0–2–4–1–3–0. Each colour has five edges and no three-edge cycle; alternatively check every triple. This one counterexample shows five is insufficient, not that every five-vertex colouring avoids monochromatic triangles—an all-red graph certainly has them. Crossings remain unlabelled; turning them into vertices changes the five-point object.
Combine upper and lower bounds before writing minimum six
Write the universal six-point result as R(3,3)≤6 and the five-point counterexample as R(3,3)>5, hence R(3,3)=6. R counts the minimum vertices; the threes describe a complete three-vertex subgraph in either colour, not six edges or three red and three blue vertices. Colour only edges. Use red solid/blue dashed lines with R/B labels for monochrome access, and separate highlight rings without overlaying blue on a red edge to create a third category.
K6: vertices=6; edges=6*5/2=15
example red={01,02,03,12}; blue=all other pairs
red triangle={01,02,12}
at 0: >=3 incident edges share a colour
three selected neighbours: same-colour edge or opposite-colour triangle
K5 control red={01,12,23,34,04}
K5 control blue={02,03,13,14,24}
no monochromatic triangle in K5 control
R(3,3)<=6 and R(3,3)>5, hence R(3,3)=6
Diagnose completeness and all three triangle edges
If no triangle is found on six vertices, check all fifteen edges and exactly one category per edge, then regroup zero’s five edges rather than searching only adjacent outer vertices. For a V, inspect the missing third side. If the five-point control has a red triangle, check a swapped 04/02. Keep the faulty draft, repair identity or colour separately, reread the edge list and then highlight. This finite deterministic proof makes no claims about real social probabilities, surveys or random colour frequencies; geometric styling does not affect it.
Reopen and recover the minimum from both arguments
Save native work, fifteen-edge example and ten-edge control, export SVG or PDF and open a PNG separately. At fit-to-window size inspect the six-/five-point frames; enlarge for complete dashed blue edges and no extra crossing dots. Reopen editable work, hide the result, recover the upper bound through five incident edges and the lower bound through both five-cycles. Deliver the triangle definition, exhaustive cases and control edge list; mark unperformed output pending. The app neither enumerates colourings, proves Ramsey numbers nor analyses real social networks, and one illustration is no all-configuration device test.
Related tutorials and sources
VectorPaint complete three-by-three bipartite graphs: crossings are not vertices and nonplanarity needs proof; VectorPaint bipartite matching: reassign three tasks along an alternating path and test a local obstruction.
Method sources: MIT: Ramsey Numbers and the proof for R(3,3). The source establishes two-colour complete graphs, minimum vertex count and the six-point/five-point argument. Numbering, the four-red/eleven-blue example and edge lists are independently checked, without real social interpretations.
Version and operation scope: checked on 19 November 2026 against the official VectorPaint listing and Apple public lookup: version 1.0.8, requiring iOS / iPadOS 17.0 or later. Draw manually with published shapes, pen, Bézier nodes, grids/guides, alignment, layers/groups, text and file output through visible installed controls. Prepare definitions and calculations externally; infer no built-in formula, statistics or graph solver. Keep editable native work and inspect SVG, PDF or PNG as needed. SVG/PDF containing imported bitmaps do not automatically become entirely vector. Canvases and samples are original teaching settings, without physical-device execution or real measurement; mark unperformed actions pending.