Fulkerson–Chen–Anstee theorem
id:
fulkerson-chen-anstee-theorem-197-4661126
title:
Fulkerson–Chen–Anstee theorem
text:
The Fulkerson–Chen–Anstee theorem is a result in graph theory, a branch of combinatorics. It provides one of two known approaches solving the digraph realization problem, i.e. it gives a necessary and sufficient condition for pairs of nonnegative integers to be the indegree-outdegree pairs of a simple directed graph; a sequence obeying these conditions is called "digraphic". D. R. Fulkerson (1960) obtained a characterization analogous to the classical Erdős–Gallai theorem for graphs, but in cont
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Fulkerson%E2%80%93Chen%E2%80%93Anstee_theorem
date created:
date modified:
2023-03-11T07:03:39Z
main entity:
{"identifier":"Q18206243","url":"https://www.wikidata.org/entity/Q18206243"}
image:
fields total:
13
integrity:
13