Graphs with given valences

DOI10.1007/BF02940878MaRDI QIDQ1969656zbMATH OpenFDO

Authors Manfred Schocker

Publication date 19 March 2000

Published in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02940878

zbMATH Keywords

Erdős-Gallai theoremGale-Ryser theoremgraph theory

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

The paper contains a short proof of the Gale-Ryser theorem (which states a necessary and sufficient condition for the existence of a \((0,1)\)-matrix with prescribed vectors of row sums and column sums). Furthermore, it is shown that the Gale-Ryser theorem is logically equivalent to the Erdős-Gallai theorem (which states a necessary and sufficient condition for the existence of a graph with prescribed vector of vertex-degrees).

Recommendations

• Graphs with many valencies and few eigenvalues
• Graphs with restricted valency and matching number
• Set-valued graphs
• Graphs with given connectivity properties
• On set valuations of graphs
• scientific article; zbMATH DE number 166086
• scientific article; zbMATH DE number 874567
• Graphs with a given degree sequence
• The position value and the structures of graphs
• On set-valuations of graphs

Cites work

• A Simple Proof of the Gale-Ryser Theorem
• A theorem on flows in networks
• Combinatorial matrix theory
• Combinatorial Properties of Matrices of Zeros and Ones
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3720966 (Why is no real title available?)
• scientific article; zbMATH DE number 3771876 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• The Erdős-Gallai criterion and symmetric functions

Cited in

(5)

• Valencies and IP-graphs of association schemes
• Graphs with restricted valency and matching number
• scientific article; zbMATH DE number 4059421 (Why is no real title available?)
• A Simple Proof of the Gale-Ryser Theorem
• A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences

This page was built for publication: Graphs with given valences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969656)