User:David Eppstein/Todo

Potential good article nominations

Ready to go?

• Blichfeldt's theorem
• Roberts's triangle theorem
• Two ears theorem

Still working to get ready:

• 1/3–2/3 conjecture
• Aanderaa–Karp–Rosenberg conjecture
• Absolute value
• Antimatroid (but join-distributive section still needs better sourcing)
• Apollonian network
• Arc diagram (feels a little telegraphic)
• Binary tiling (conn Smith chart not covered at all and conn Escher dubiously sourced)
• Birkhoff's representation theorem (badly sourced)
• Boyer–Moore majority vote algorithm (one unsourced sentence; say a little more about generalization and/or situations where this algorithm has come up)
• Bricard octahedron (can we source regular octahedron coordinate example? and do we really describe a complete construction of all of these? see doi:10.1016/j.mechmachtheory.2019.103663)
• Circle packing theorem (needs work; mention new degeneracy ordering arXiv:2201.09340)
• Coffman–Graham algorithm (needs more algorithmic detail)
• Computational complexity (needs work especially referencing, but important and reasonably solid already)
• Cycle basis (widely applicable, needs a pass for technicality and sourcing check)
• Congruum
• Danzer set (check recent survey arXiv:2010.06756 for completeness)
• Dedekind–MacNeille completion (technical and needs a better lead)
• Delone set (too technical, maybe missing material?)
• Dessin d'enfant (needs more work on sourcing)
• Edge coloring
• Egyptian fraction (needs better sourcing of history)
• End (graph theory)
• Existential theory of the reals (example section unsourced, otherwise looks ok)
• Exponential time hypothesis (check recent pubs; still quite technical)
• Factor-critical graph (check for technicality and completeness)
• Falconer's conjecture (still a little slim, maybe expandable)
• Fibonacci cube
• Folkman graph (pending unpublished source)
• Four-vertex theorem (but discrete part needs better sourcing)
• Fractional cascading (good content but needs sourcing + editing for tone)
• Frucht's theorem (content there is ok and sourced, but doesn't mention appls)
• Gallai–Hasse–Roy–Vitaver theorem (some unsourced paragraphs)
• Grid bracing (pretty good but needs a better lead)
• Grinberg's theorem (maybe expand connection w/Euler formula)
• Grundy number (feels a little broken up)
• Hanner polytope
• Haven (graph theory) (needs more sources)
• Intersection number (graph theory) (getting close but I still keep finding more material to add; still needs a pass for organizational clarity and technical writing)
• Kate Claghorn
• Kruskal's algorithm (bad shape but fixable)
• Lambek–Moser theorem (proof section seems too skeletal)
• Lexicographic breadth-first search (needs more thorough footnoting, and cleanup of overly technical material)
• Locally linear graph (missing: are these graphs useful for anything?)
• Matchstick graph (close but related work paragraph needs sources and maybe we should wait until 2022 preprint on low-degree vertices is published)
• Median graph (needs better sourcing, at least)
• Moser–de Bruijn sequence (can we make this less technical? Also connection to fibbinary unsourced, and my Egyptian paper isn't a very good source to use)
• Odd graph
• Parallelohedron (in good shape but do another literature search for completeness of coverage)
• Parametric search (needs citation format update)
• Partition refinement (pretty good shape but needs more footnotes + completeness check)
• Penny graph too much definition in lead, not repeated in body
• Perles configuration a little telegraphic in places
• Perspectiva corporum regularium (can we source more about its influence?)
• Pinwheel scheduling applications needs expansion; also explain algorithm for low-density scheduling?
• Planar separator theorem (needs more footnotes and maybe some trimming of Divide and conquer algorithms section)
• Pythagorean addition (mostly needs a lot more sourcing)
• Quadratrix of Hippias
• Queue number
• Reinhardt polygon
• Salem–Spencer set (but waiting for Bloom & Sisask 2020 to be properly published)
• Sauer–Shelah lemma
• Semiorder (needs better sourcing)
• Smoothed octagon (needs better sourcing)
• Squaring the square
• Steinhaus–Johnson–Trotter algorithm (PADS impl is simpler; can we source it?)
• Strahler number
• Tabulation hashing
• Thrackle (could use more detail in "known bounds"; maybe also in known examples of thrackles)
• Tripod packing (consider at least hinting at improved lower bound ideas)
• Twin-width
• Universal vertex (some unsourced statements)
• Vietoris–Rips complex

...and all the B-class articles from the Wikipedia books.