29 relations: American Mathematical Monthly, Boxicity, Chromatic polynomial, Clique (graph theory), Cograph, Combinatorics, Probability and Computing, Complement graph, Complete bipartite graph, Complete graph, Cross-polytope, Disjoint union, Eigenvalues and eigenvectors, Equitable coloring, Erdős–Stone theorem, Extremal graph theory, Geometric graph theory, Graph coloring, Graph drawing, International Symposium on Graph Drawing, Matching (graph theory), Moore graph, Multipartite graph, N-skeleton, Octahedron, Pál Turán, Regular graph, Strongly regular graph, Symmetric graph, Turán's theorem.
American Mathematical Monthly
The American Mathematical Monthly is a mathematical journal founded by Benjamin Finkel in 1894.
New!!: Turán graph and American Mathematical Monthly · See more »
Boxicity
In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969.
New!!: Turán graph and Boxicity · See more »
Chromatic polynomial
The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics.
New!!: Turán graph and Chromatic polynomial · See more »
Clique (graph theory)
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete.
New!!: Turán graph and Clique (graph theory) · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Turán graph and Cograph · See more »
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing is a peer-reviewed scientific journal in mathematics published by Cambridge University Press.
New!!: Turán graph and Combinatorics, Probability and Computing · See more »
Complement graph
In graph theory, the complement or inverse of a graph is a graph on the same vertices such that two distinct vertices of are adjacent if and only if they are not adjacent in.
New!!: Turán graph and Complement graph · See more »
Complete bipartite graph
No description.
New!!: Turán graph and Complete bipartite graph · See more »
Complete graph
No description.
New!!: Turán graph and Complete graph · See more »
Cross-polytope
In geometry, a cross-polytope, orthoplex, hyperoctahedron, or cocube is a regular, convex polytope that exists in n-dimensions.
New!!: Turán graph and Cross-polytope · See more »
Disjoint union
In set theory, the disjoint union (or discriminated union) of a family of sets is a modified union operation that indexes the elements according to which set they originated in.
New!!: Turán graph and Disjoint union · See more »
Eigenvalues and eigenvectors
In linear algebra, an eigenvector or characteristic vector of a linear transformation is a non-zero vector that changes by only a scalar factor when that linear transformation is applied to it.
New!!: Turán graph and Eigenvalues and eigenvectors · See more »
Equitable coloring
In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way that.
New!!: Turán graph and Equitable coloring · See more »
Erdős–Stone theorem
In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H. It is named after Paul Erdős and Arthur Stone, who proved it in 1946, and it has been described as the “fundamental theorem of extremal graph theory”.
New!!: Turán graph and Erdős–Stone theorem · See more »
Extremal graph theory
Extremal graph theory is a branch of the mathematical field of graph theory.
New!!: Turán graph and Extremal graph theory · See more »
Geometric graph theory
A geometric graph is a graph in which the vertices or edges are associated with geometric objects, the simplest realisation is a Random geometric graph.
New!!: Turán graph and Geometric graph theory · See more »
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
New!!: Turán graph and Graph coloring · See more »
Graph drawing
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics.
New!!: Turán graph and Graph drawing · See more »
International Symposium on Graph Drawing
The International Symposium on Graph Drawing (GD) is an annual academic conference in which researchers present peer reviewed papers on graph drawing, information visualization of network information, geometric graph theory, and related topics.
New!!: Turán graph and International Symposium on Graph Drawing · See more »
Matching (graph theory)
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
New!!: Turán graph and Matching (graph theory) · See more »
Moore graph
In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1.
New!!: Turán graph and Moore graph · See more »
Multipartite graph
In graph theory, a part of mathematics, a k-partite graph is a graph whose vertices are or can be partitioned into k different independent sets.
New!!: Turán graph and Multipartite graph · See more »
N-skeleton
In mathematics, particularly in algebraic topology, the of a topological space X presented as a simplicial complex (resp. CW complex) refers to the subspace Xn that is the union of the simplices of X (resp. cells of X) of dimensions In other words, given an inductive definition of a complex, the is obtained by stopping at the.
New!!: Turán graph and N-skeleton · See more »
Octahedron
In geometry, an octahedron (plural: octahedra) is a polyhedron with eight faces, twelve edges, and six vertices.
New!!: Turán graph and Octahedron · See more »
Pál Turán
Pál Turán (18 August 1910 – 26 September 1976) also known as Paul Turán, was a Hungarian mathematician who worked primarily in number theory.
New!!: Turán graph and Pál Turán · See more »
Regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.
New!!: Turán graph and Regular graph · See more »
Strongly regular graph
In graph theory, a strongly regular graph is defined as follows.
New!!: Turán graph and Strongly regular graph · See more »
Symmetric graph
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism such that In other words, a graph is symmetric if its automorphism group acts transitively upon ordered pairs of adjacent vertices (that is, upon edges considered as having a direction).
New!!: Turán graph and Symmetric graph · See more »
Turán's theorem
In graph theory, Turán's theorem is a result on the number of edges in a ''K''''r''+1-free graph.
New!!: Turán graph and Turán's theorem · See more »
Redirects here:
Cocktail party graph, Octahedral Graph, Octahedral graph, Turan graph.
References
[1] https://en.wikipedia.org/wiki/Turán_graph