Display title | Graph theory |
Default sort key | Graph theory |
Page length (in bytes) | 4,111 |
Namespace ID | 0 |
Page ID | 1790 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Delete | Allow all users (infinite) |
Page creator | BetterVotingAdvocacy (talk | contribs) |
Date of page creation | 17:41, 24 February 2020 |
Latest editor | BetterVotingAdvocacy (talk | contribs) |
Date of latest edit | 22:57, 24 March 2020 |
Total number of edits | 6 |
Recent number of edits (within past 180 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | Graph theory is the investigation of graphs, which shows the relationships between every pair of objects while only showing each object once within the same diagram. It is often used in the context of voting theory to discuss Condorcet methods, most of which use pairwise counting to determine which candidates or groups of candidates are better than others. |