V. J. Havel
Encyclopedia
V. J. Havel is a Czech mathematician
known for his work with S. L. Hakimi
independently on realizing a set of integers as a degree sequence
of a graph. This algorithm
was found out at the same time Erdős
–Gallai
gave their mathematical criteria.
Mathematician
A mathematician is a person whose primary area of study is the field of mathematics. Mathematicians are concerned with quantity, structure, space, and change....
known for his work with S. L. Hakimi
S. L. Hakimi
S. Louis Hakimi is a mathematician, a professor emeritus of mathematics at Northwestern University, IL. He is known for his work with V. J. Havel independently on realizing a set of integers as a degree sequence of a graph. This algorithm was found out at the same time Erdos-Gallai gave their...
independently on realizing a set of integers as a degree sequence
Degree (graph theory)
In graph theory, the degree of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree of a vertex v is denoted \deg. The maximum degree of a graph G, denoted by Δ, and the minimum degree of a graph, denoted by δ, are the maximum and minimum degree...
of a graph. This algorithm
Algorithm
In mathematics and computer science, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Algorithms are used for calculation, data processing, and automated reasoning...
was found out at the same time Erdős
Paul Erdos
Paul Erdős was a Hungarian mathematician. Erdős published more papers than any other mathematician in history, working with hundreds of collaborators. He worked on problems in combinatorics, graph theory, number theory, classical analysis, approximation theory, set theory, and probability theory...
–Gallai
Tibor Gallai
Tibor Gallai was a Hungarian mathematician. He worked in combinatorics, especially in graph theory, and was a lifelong friend and collaborator of Paul Erdős. He was a student of Dénes König and an advisor of László Lovász...
gave their mathematical criteria.
See also
- Degree (graph theory)Degree (graph theory)In graph theory, the degree of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree of a vertex v is denoted \deg. The maximum degree of a graph G, denoted by Δ, and the minimum degree of a graph, denoted by δ, are the maximum and minimum degree...