Another triumph of obfuscation by the editors of Wikipedia is the page on Snark (graph theory).
The opening paragraph reads: In the mathematical field of graph theory, a snark is a simple, connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, the connectivity is redundant so that removing no one edge would split the graph, and the edges cannot be colored by only three colors without two edges of the same color meeting at a point. (By Vizing's theorem, the chromatic index of a cubic graph is 3 or 4.) In order to avoid trivial cases, snarks are often restricted to have girth at least 5.
Palpable blither.
Encyclopedia for the masses indeed.
No comments:
Post a Comment
IMPORTANT: PLEASE CLICK "PREVIEW" IN ORDER TO FORCE THE BUGGY CAPCHA CODE TO LAUNCH OR YOUR COMMENT WILL SIMPLY EVAPORATE!
The procedure that works for anonymous posting is:
1) WRITE COMMENT IN TEXTAREA PROVIDED
2) SELECT THE 'ANONYMOUS' RADIO BUTTON
3) CLICK PREVIEW
4) CLICK ON "I AM NOT A ROBOT"
5) DO THE STUPID PUZZLE
6) DO IT AGAIN IF IT MAKES YOU
7) CLICK PUBLISH ON THE BUTTON AT THE PAGE FOOT
IF YOUR COMMENT DOES NOT DISAPPEAR FROM THE TEXTAREA, IT DIDN'T POST.
This user experience enhancement brought to you by the happy code gnomes at Google.