REVIEW 3 cited by
An introduction to graph theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and arborescences. Among the features discussed are Eulerian circuits, Hamiltonian cycles, spanning trees, the matrix-tree and BEST theorems, proper colorings, Turan's theorem, bipartite matching and the Menger and Gallai--Milgram theorems. The basics of network flows are introduced in order to prove Hall's marriage theorem. Around a hundred exercises are included (without solutions).
Forward citations
Cited by 3 Pith papers
-
An equality for balanced digraphs
The number of k-arc acyclic subdigraphs in which every vertex can reach a fixed root is independent of the root, for any balanced digraph.
-
Semantic-Geometric Task Representations for Bimanual Manipulation from Human Demonstrations to Robot Action Planning
A message-passing graph encoder that jointly models semantic object relations and geometric motion, paired with a Transformer decoder, improves long-horizon action, object, and motion prediction from human bimanual de...
-
A reentrancy of motility-induced phase separation in overdamped active Brownian particles
MIPS in overdamped active Brownian particles is reentrant at high Péclet number because a surface self-propulsion force f_LA drives slip deformation that fluidizes the cluster.
Discussion (0). Sign in to comment.