NCAA college football 2000 (corrected metadata)

A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular: There are are two issues with the original GN file. First three teams met twice in one season so the graph is not simple. This is easily dealt with if required. Secondly, the assignments to conferences, the node values, seem to be for the 2001 season and not the 2000 season. The games do appear to be for the 2000 season as

npx keepset fetch netzschleuder-football_tsevans

Nodes: 115
Edges: 613
Size: 4.9 KiB

Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.

Overview

Id	`netzschleuder-football_tsevans`
Namespace	`netzschleuder`
Aliases	`football_tsevans`
Category	`graph/v1`
Kind	graph
Domain	Social network
Licence	not recorded by the source
Catalogue	`keepset` 1.33.0

Sources and provenance

#	URL	Status	Retrieved	Read by recipe	Pinned snapshot	SHA-256
0	https://figshare.com/articles/American_College_Football_Network_Files/93179	live	2026-04-20		20200222153822raw	`e25beec8e341`
1	https://networks.skewed.de/net/football_tsevans	live	2026-04-20		20260606105734raw	`89a03905cf5b`
2	https://networks.skewed.de/net/football_tsevans/files/football_tsevans.csv.zip	live	2026-04-20	yes	20261022015237raw	`6fe1d1aeb56b`

Citations

M. Girvan and M. E. J. Newman, "Community structure in social and biological networks." Proc. Natl. Acad. Sci. USA 99(12), 7821-7826 (2002). doi:10.1073/pnas.122653799
T.S. Evans, "Clique Graphs and Overlapping Communities", J. Stat. Mech. (2010) P12037 doi:10.1088/1742-5468/2010/12/P12037

Recipe

Source	#2
Archive	zip
Member	`edges.csv`
Parser format	`"edge-list"`
Parser encoding	`"utf-8"`
Parser delimiter	`"comma"`
Parser skipLines	`0`
Parser commentPrefixes	`["#"]`
Parser sourceColumn	`0`
Parser targetColumn	`1`

Crosswalk

keepset/topology to graph/v1, as a crossmap crosswalk.

Rule	From	To	Direction
move	`meta`	`meta`	both
move	`nodes[].id`	`nodes[].id`	both
move	`edges[].source`	`edges[].source`	both
move	`edges[].target`	`edges[].target`	both

Expected counts

Edges	613
Nodes	115

Properties

Directed	no
Download bytes	4.9 KiB
Heterogeneous	no
Multigraph	no
Self loops	no
Weighted	no