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 Editorial board of JCTB Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. In 2020, most of the editorial board of ''JCTA'' resigned to form a new, [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Elsevier
Elsevier ( ) is a Dutch academic publishing company specializing in scientific, technical, and medical content. Its products include journals such as ''The Lancet'', ''Cell (journal), Cell'', the ScienceDirect collection of electronic journals, ''Trends (journals), Trends'', the ''Current Opinion (Elsevier), Current Opinion'' series, the online citation database Scopus, the SciVal tool for measuring research performance, the ClinicalKey search engine for clinicians, and the ClinicalPath evidence-based cancer care service. Elsevier's products and services include digital tools for Data management platform, data management, instruction, research analytics, and assessment. Elsevier is part of the RELX Group, known until 2015 as Reed Elsevier, a publicly traded company. According to RELX reports, in 2022 Elsevier published more than 600,000 articles annually in over 2,800 journals. As of 2018, its archives contained over 17 million documents and 40,000 Ebook, e-books, with over one b ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Erdős–Ko–Rado Theorem
In mathematics, the Erdős–Ko–Rado theorem limits the number of Set (mathematics), sets in a family of sets for which every two sets have at least one element in common. Paul Erdős, Chao Ko, and Richard Rado proved the theorem in 1938, but did not publish it until 1961. It is part of the field of combinatorics, and one of the central results of The theorem applies to families of sets that all have the same and are all subsets of some larger set of size One way to construct a family of sets with these parameters, each two sharing an element, is to choose a single element to belong to all the subsets, and then form all of the subsets that contain the chosen element. The Erdős–Ko–Rado theorem states that when n is large enough for the problem to be nontrivial this construction produces the largest possible intersecting families. When n=2r there are other equally-large families, but for larger values of n only the families constructed in this way can be largest. The Erd ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Academic Journals Established In 1966
An academy (Attic Greek: Ἀκαδήμεια; Koine Greek Ἀκαδημία) is an institution of tertiary education. The name traces back to Plato's school of philosophy, founded approximately 386 BC at Akademia, a sanctuary of Athena, the goddess of wisdom and skill, north of Athens, Greece. The Royal Spanish Academy defines academy as scientific, literary or artistic society established with public authority and as a teaching establishment, public or private, of a professional, artistic, technical or simply practical nature. Etymology The word comes from the ''Academy'' in ancient Greece, which derives from the Athenian hero, ''Akademos''. Outside the city walls of Athens, the gymnasium was made famous by Plato as a center of learning. The sacred space, dedicated to the goddess of wisdom, Athena, had formerly been an olive Grove (nature), grove, hence the expression "the groves of Academe". In these gardens, the philosopher Plato conversed with followers. Plato develop ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Combinatorics Journals
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is gr ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Imre Bárány
Imre Bárány (Mátyásföld, Budapest Budapest is the Capital city, capital and List of cities and towns of Hungary, most populous city of Hungary. It is the List of cities in the European Union by population within city limits, tenth-largest city in the European Union by popul ..., 7 December 1947) is a Hungarian people, Hungarian mathematician, working in combinatorics and discrete geometry. He works at the Alfréd Rényi Institute of Mathematics, Rényi Mathematical Institute of the Hungarian Academy of Sciences, and has a part-time appointment at University College London. Notable results * He gave a surprisingly simple alternative proof of László Lovász's theorem on Kneser graphs. * He gave a new proof of the Borsuk–Ulam theorem. * Bárány gave a colored version of Carathéodory's theorem (convex hull), Carathéodory's theorem. * He solved an old problem of James Joseph Sylvester on the probability of random point sets in convex position. * With Van H. Vu pro ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
László Lovász
László Lovász (; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020. In graph theory, Lovász's notable contributions include the proofs of Kneser's conjecture and the Lovász local lemma, as well as the formulation of the Erdős–Faber–Lovász conjecture. He is also one of the eponymous authors of the LLL lattice reduction algorithm. Early life and education Lovász was born on March 9, 1948, in Budapest, Hungary. Lovász attended the Fazekas Mihály Gimnázium in Budapest. He won three gold medals (1964–1966) and one silver medal (1963) at the International Mathematical Olympiad. He also participated in a Hungarian game show about math prodigi ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Kneser Graph
Kneser is a surname. Notable people with the surname include: * Adolf Kneser (1862–1930), mathematician * Hellmuth Kneser (1898–1973), mathematician, son of Adolf Kneser * Martin Kneser (1928–2004), mathematician, son of Hellmuth Kneser {{surname ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Graph Minors Theorem
Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties *Graph (topology), a topological space resembling a graph in the sense of discrete mathematics *Graph of a function * Graph of a relation *Graph paper *Chart, a means of representing data (also called a graph) Computing *Graph (abstract data type), an abstract data type representing relations or connections *graph (Unix), Unix command-line utility *Conceptual graph, a model for knowledge representation and reasoning *Microsoft Graph, a Microsoft API developer platform that connects multiple services and devices Other uses * HMS ''Graph'', a submarine of the UK Royal Navy See also * Complex network *Graf *Graff (other) *Graph database *Grapheme, in linguistics *Graphemics *Graphic (other) *-graphy (suffix from the Greek for "describe," "write" or "draw") *List of information graphics software *Statis ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Minor (graph Theory)
Minor may refer to: Common meanings * Minor (law), a person not under the age of certain legal activities. * Academic minor, a secondary field of study in undergraduate education Mathematics * Minor (graph theory), a relation of one graph to another * Minor (matroid theory), a relation of one matroid to another * Minor (linear algebra), the determinant of a square submatrix Music * Minor chord * Minor interval * Minor key * Minor scale People * Minor (given name), a masculine given name * Minor (surname), a surname Places in the United States * Minor, Alabama, a census-designated place * Minor, Virginia, an unincorporated community * Minor Creek (California) * Minor Creek (Missouri) * Minor Glacier, Wyoming Sports * Minor, a grade in Gaelic games; also, a person who qualifies to play in that grade * Minor league, a sports league not regarded as a premier league ** Minor League Baseball Minor League Baseball (MiLB) is a professional baseball organization ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Paul Seymour (mathematician)
Paul D. Seymour is a British mathematician known for his work in discrete mathematics, especially graph theory. He (with others) was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers are available from his website. Seymour is currently the Albert Baldwin Dod Professor of Mathematics at Princeton University. He won a Sloan Fellowship in 1983, and the Ostrowski Prize in 2003; and (sometimes with others) won the Fulkerson Prize in 1979, 1994, 2006 and 2009, and the Pólya Prize in 1983 and 2004. He received an honorary doctorate from the University of Waterloo in 2008, one from the Technical University of Denmark in 2013, and one from the École normale supérieure de Lyon in 2022. He was an invited speaker i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Neil Robertson (mathematician)
George Neil Robertson (born November 30, 1938) is a mathematician working mainly in topological graph theory, currently a distinguished professor emeritus at the Ohio State University. Education Robertson earned his B.Sc. from Brandon College in 1959 and his Ph.D. in 1969 at the University of Waterloo under his doctoral advisor William Tutte. Biography In 1969, Robertson joined the faculty of the Ohio State University, where he was promoted to Associate Professor in 1972 and Professor in 1984. He was a consultant with Bell Communications Research from 1984 to 1996. He has held visiting faculty positions in many institutions, most extensively at Princeton University from 1996 to 2001, and at Victoria University of Wellington, New Zealand, in 2002. He also holds an adjunct position at King Abdulaziz University in Saudi Arabia.. Research Robertson is known for his work in graph theory, and particularly for a long series of papers co-authored with Paul Seymour and published over ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Gyula O
Gyula may refer to: * Gyula (title), Hungarian leader title in the 9th–10th centuries * Gyula (name), Hungarian male given name, derived from the title ; People * Gyula II, the Hungarian ''gyula'' who ruled Transylvania in the 10th-century and was baptized in Constantinople around 950 * Gyula III, the ''gyula'' who ruled Transylvania and was defeated by his maternal uncle, King Stephen I of Hungary around 1003 ; Places * Gyula, Hungary, town in Hungary * Gyulaháza, village in Hungary * Gyulakeszi, village in Hungary * , Hungarian name of Alba Iulia, city in Romania, the former seat of the Transylvanian ''gyulas'' {{disambiguation, hn, geo ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |