Math 2.0

Combinatorics Concept

Repair radii and villainy

Builds on Graph colouringDistance from a point to a set

Summary

A repair radius measures how far a colouring of a graph GG with a given profile of class sizes can be from a proper one.

The radius RG(m)R_G(m) is the largest Hamming distance from a point to a set, over colourings with profile mm, to the set of proper colourings with profile mm.

The weak radius RGw(m)R^w_G(m) lets the nearest proper colouring have any profile.

The villainy B(G)B(G) and the weak villainy Bw(G)B_w(G) are the maxima of these radii over feasible profiles, and both are zero for the empty graph.

Reading path

To understand this page from the ground up, read these 20 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Graph colouring definition
  3. Proposition concept
  4. Real numbers object
  5. Set bounded above definition
  6. Set definition
  7. Implication definition
  8. Predicate definition
  9. Infimum definition
  10. Ordered pair definition
  11. Existential quantifier definition
  12. Universal quantifier definition
  13. Cartesian product definition
  14. Subset definition
  15. Uniqueness quantifier definition
  16. Binary relation definition
  17. Function definition
  18. Metric space definition
  19. Distance from a point to a set definition
  20. Repair radii and villainy concept

Further reading

  1. mention ax://paper/2610.13556#L0DK, Definition 2.2. the paper that states the item (corpus arxiv AX9.2)

In the catalogue

About this page
TagEBNHD7FQ23
URIm2://EBNHD7FQ23
Kindconcept
WritingW1 stated
MSC05-XX
UsesGraph colouring, Distance from a point to a set
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-02addthe whole nodetamnd

What links here

Definitions