|
Hedetniemi Conjecture
In graph theory, Hedetniemi's conjecture, formulated by Stephen T. Hedetniemi in 1966, concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that : \chi (G \times H ) = \min\. Here \chi(G) denotes the chromatic number of an undirected finite graph G. The inequality χ(''G'' × ''H'') ≤ min is easy: if ''G'' is ''k''-colored, one can ''k''-color ''G'' × ''H'' by using the same coloring for each copy of ''G'' in the product; symmetrically if ''H'' is ''k''-colored. Thus, Hedetniemi's conjecture amounts to the assertion that tensor products cannot be colored with an unexpectedly small number of colors. A counterexample to the conjecture was discovered by (see ), thus disproving the conjecture in general. Known cases Any graph with a nonempty set of edges requires at least two colors; if ''G'' and ''H'' are not 1-colorable, that is, they both contain an edge, then their product also contains an edge, and is hence not 1-color ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exponential Object
In mathematics, specifically in category theory, an exponential object or map object is the categorical generalization of a function space in set theory. Categories with all finite products and exponential objects are called cartesian closed categories. Categories (such as subcategories of Top) without adjoined products may still have an exponential law. Definition Let \mathbf be a category, let Z and Y be objects of \mathbf, and let \mathbf have all binary products with Y. An object Z^Y together with a morphism \mathrm\colon (Z^Y \times Y) \to Z is an ''exponential object'' if for any object X and morphism g \colon X\times Y \to Z there is a unique morphism \lambda g\colon X\to Z^Y (called the ''transpose'' of g) such that the following diagram commutes: This assignment of a unique \lambda g to each g establishes an isomorphism (bijection In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Products
In graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs and and produces a graph with the following properties: * The vertex set of is the Cartesian product , where and are the vertex sets of and , respectively. * Two vertices and of are connected by an edge, iff a condition about in and in is fulfilled. The graph products differ in what exactly this condition is. It is always about whether or not the vertices in are equal or connected by an edge. The terminology and notation for specific graph products in the literature varies quite a lot; even if the following may be considered somewhat standard, readers are advised to check what definition a particular author uses for a graph product, especially in older texts. Overview table The following table shows the most common graph products, with \sim denoting "is connected by an edge to", and \not\sim denoting non-connection. The operator symbols lis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Numberphile
''Numberphile'' is an educational YouTube channel featuring videos that explore topics from a variety of fields of mathematics. In the early days of the channel, each video focused on a specific number, but the channel has since expanded its scope, featuring videos on more advanced mathematical concepts such as Fermat's Last Theorem, the Riemann hypothesis and Kruskal's tree theorem. The videos are produced by Brady Haran, a former BBC video journalist and creator of Periodic Videos, Sixty Symbols, and several other YouTube channels. Videos on the channel feature several university professors, maths communicators and famous mathematicians. In 2018, Haran released a spin-off audio podcast titled ''The Numberphile Podcast''. YouTube channel The ''Numberphile'' YouTube channel was started on 15 September 2011. Most videos consist of Haran interviewing an expert on a number, mathematical theorem or other mathematical concept. The expert usually draws out their explanation on a la ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Mathematics (journal)
''Discrete Mathematics'' is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications. It was established in 1971 and is published by North-Holland Publishing Company. It publishes both short notes, full length contributions, as well as survey articles. In addition, the journal publishes a number of special issues each year dedicated to a particular topic. Although originally it published articles in French and German, it now allows only English language articles. The editor-in-chief is Douglas West ( University of Illinois, Urbana). History The journal was established in 1971. The very first article it published was written by Paul Erdős, who went on to publish a total of 84 papers in the journal. Abstracting and indexing The journal is abstracted and indexed in: According to the ''Journal Citation Reports'', the journal has a 2020 impact factor of 0.87. Notable publications * The 1972 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Combinatorial Theory
The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applications of combinatorics. ''Series B'' is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as ''JCTA'' and ''JCTB''. The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.They are acknowledged on the journals' title pages and Web sites. SeEditorial board of JCTA Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. An electronic, [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Graph Theory
The ''Journal of Graph Theory'' is a peer-reviewed mathematics journal specializing in graph theory and related areas, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. It is published by John Wiley & Sons. The journal was established in 1977 by Frank Harary.Frank Harary a biographical sketch at the ACM site The are [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Canadian Journal Of Mathematics
The ''Canadian Journal of Mathematics'' (french: Journal canadien de mathématiques) is a bimonthly mathematics journal published by the Canadian Mathematical Society. It was established in 1949 by H. S. M. Coxeter and G. de B. Robinson. The current editors-in-chief of the journal are Louigi Addario-Berry and Eyal Goren. The journal publishes articles in all areas of mathematics. See also * Canadian Mathematical Bulletin The ''Canadian Mathematical Bulletin'' (french: Bulletin Canadien de Mathématiques) is a mathematics journal, established in 1958 and published quarterly by the Canadian Mathematical Society. The current editors-in-chief of the journal are Antoni ... References External links * University of Toronto Press academic journals Mathematics journals Publications established in 1949 Bimonthly journals Multilingual journals Cambridge University Press academic journals Academic journals associated with learned and professional societies of Canada ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Combinatorial Theory, Series B
The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applications of combinatorics. ''Series B'' is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as ''JCTA'' and ''JCTB''. The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.They are acknowledged on the journals' title pages and Web sites. SeEditorial board of JCTA Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. An electronic, [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorica
''Combinatorica'' is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are Imre Bárány and József Solymosi. The advisory board consists of Ronald Graham, Gyula O. H. Katona, Miklós Simonovits, Vera Sós, and Endre Szemerédi. It is published by the János Bolyai Mathematical Society and Springer Verlag. The following members of the '' Hungarian School of Combinatorics'' have strongly contributed to the journal as authors, or have served as editors: Miklós Ajtai, László Babai, József Beck, András Frank, Péter Frankl, Zoltán Füredi, András Hajnal, Gyula Katona, László Lovász, László Pyber, Alexander Schrijver, Miklós Simonovits, Vera Sós, Endre Szemerédi, Tamás Szőnyi, Éva Tardos, Gábor Tardos.{{cite web, url=https://www.springer.com/ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lexicographic Product Of Graphs
In graph theory, the lexicographic product or (graph) composition of graphs and is a graph such that * the vertex set of is the cartesian product ; and * any two vertices and are adjacent in if and only if either is adjacent with in or and is adjacent with in . If the edge relations of the two graphs are order relations, then the edge relation of their lexicographic product is the corresponding lexicographic order. The lexicographic product was first studied by . As showed, the problem of recognizing whether a graph is a lexicographic product is equivalent in complexity to the graph isomorphism problem. Properties The lexicographic product is in general noncommutative: . However it satisfies a distributive law with respect to disjoint union: . In addition it satisfies an identity with respect to complementation: . In particular, the lexicographic product of two self-complementary graphs is self-complementary. The independence number of a lexicographic product ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Product Of Graphs
Cartesian means of or relating to the French philosopher René Descartes—from his Latinized name ''Cartesius''. It may refer to: Mathematics *Cartesian closed category, a closed category in category theory *Cartesian coordinate system, modern rectangular coordinate system * Cartesian diagram, a construction in category theory *Cartesian geometry, now more commonly called analytic geometry * Cartesian morphism, formalisation of ''pull-back'' operation in category theory *Cartesian oval, a curve *Cartesian product, a direct product of two sets *Cartesian product of graphs, a binary operation on graphs *Cartesian tree, a binary tree in computer science Philosophy *Cartesian anxiety, a hope that studying the world will give us unchangeable knowledge of ourselves and the world *Cartesian circle, a potential mistake in reasoning *Cartesian doubt, a form of methodical skepticism as a basis for philosophical rigor *Cartesian dualism, the philosophy of the distinction between mind and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
