|
J. A. Bondy
John Adrian Bondy (born 1944 in London) is a retired English mathematician, known for his work in combinatorics and graph theory. Career Bondy received his Ph.D. in graph theory from the University of Oxford in 1969. His advisor was Dominic Welsh. Between 1969 and 1994, Bondy was ''Professor of Graph Theory'' at the University of Waterloo in Canada, and then, until his retirement, at Université Lyon 1 in France. From 1976, he was managing editor, and, between 1979 and 2004, co-editor-in-chief (together with U. S. R. Murty) of Journal of Combinatorial Theory, Series B. Throughout his career, Bondy has (co-)authored over 100 publications with 51 co-authors, including the widely influential textbook ''Graph Theory with Applications'' (with U. S. R. Murty), and supervised 12 Ph.D. students. His Erdős number is 1. Bondy was dismissed from his tenured position at the University of Waterloo in 1995, after 25 years in which he had been a major contributor to the renown of the Uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brackets
A bracket is either of two tall fore- or back-facing punctuation marks commonly used to isolate a segment of text or data from its surroundings. Typically deployed in symmetric pairs, an individual bracket may be identified as a 'left' or 'right' bracket or, alternatively, an "opening bracket" or "closing bracket", respectively, depending on the directionality of the context. Specific forms of the mark include parentheses (also called "rounded brackets"), square brackets, curly brackets (also called 'braces'), and angle brackets (also called 'chevrons'), as well as various less common pairs of symbols. As well as signifying the overall class of punctuation, the word "bracket" is commonly used to refer to a specific form of bracket, which varies from region to region. In most English-speaking countries, an unqualified word "bracket" refers to the parenthesis (round bracket); in the United States, the square bracket. Various forms of brackets are used in mathematics, with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vašek Chvátal
Vašek is both a Czech surname and masculine given name (diminutive of Václav Václav () is a Czech male first name of Slavic origin, sometimes translated into English as Wenceslaus or Wenceslas. These forms are derived from the old Slavic/Czech form of this name: Venceslav. Nicknames are: Vašek, Vašík, Venca, Venda Fo ...). It may refer to: Surname * Anton Vašek (1905–1946), Slovak Holocaust perpetrator * Petr Vašek (born 1979), Czech footballer * Radomír Vašek (born 1972), Czech tennis player Given name * Vašek Klouda (born 1986), Czech freestyle footbag player * Vašek Svoboda (born 1990), Czech footballer * Vašek Pospíšil (born 1990), Canadian tennis player {{DEFAULTSORT:Vasek Czech-language surnames Czech masculine given names ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Mathematical Society
The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, advocacy and other programs. The society is one of the four parts of the Joint Policy Board for Mathematics and a member of the Conference Board of the Mathematical Sciences. History The AMS was founded in 1888 as the New York Mathematical Society, the brainchild of Thomas Fiske, who was impressed by the London Mathematical Society on a visit to England. John Howard Van Amringe was the first president and Fiske became secretary. The society soon decided to publish a journal, but ran into some resistance, due to concerns about competing with the American Journal of Mathematics. The result was the '' Bulletin of the American Mathematical Society'', with Fiske as editor-in-chief. The de facto journal, as intended, was influential ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Reviews
''Mathematical Reviews'' is a journal published by the American Mathematical Society (AMS) that contains brief synopses, and in some cases evaluations, of many articles in mathematics, statistics, and theoretical computer science. The AMS also publishes an associated online bibliographic database called MathSciNet which contains an electronic version of ''Mathematical Reviews'' and additionally contains citation information for over 3.5 million items as of 2018. Reviews Mathematical Reviews was founded by Otto E. Neugebauer in 1940 as an alternative to the German journal '' Zentralblatt für Mathematik'', which Neugebauer had also founded a decade earlier, but which under the Nazis had begun censoring reviews by and of Jewish mathematicians. The goal of the new journal was to give reviews of every mathematical research publication. As of November 2007, the ''Mathematical Reviews'' database contained information on over 2.2 million articles. The authors of reviews are volunte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pancyclic Graph
In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from three up to the number of vertices in the graph.. Pancyclic graphs are a generalization of Hamiltonian graphs, graphs which have a cycle of the maximum possible length. Definitions An ''n''-vertex graph ''G'' is pancyclic if, for every k in the range 3 \leq k \leq n \; ,G contains a cycle of length k. It is node-pancyclic or vertex-pancyclic if, for every vertex ''v'' and every ''k'' in the same range, it contains a cycle of length ''k'' that contains ''v''.. Similarly, it is edge-pancyclic if, for every edge ''e'' and every ''k'' in the same range, it contains a cycle of length ''k'' that contains ''e''. A bipartite graph cannot be pancyclic, because it does not contain any odd-length cycles, but it is said to be bipancyclic if it contains cycles of all even lengths from 4 to ''n''. Planar graphs A maximal outerplanar graph is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypohamiltonian Graph
In the mathematical field of graph theory, a graph ''G'' is said to be hypohamiltonian if ''G'' itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from ''G'' is Hamiltonian. History Hypohamiltonian graphs were first studied by . cites and as additional early papers on the subject; another early work is by . sums up much of the research in this area with the following sentence: “The articles dealing with those graphs ... usually exhibit new classes of hypohamiltonian or hypotraceable graphs showing that for certain orders ''n'' such graphs indeed exist or that they possess strange and unexpected properties.” Applications Hypohamiltonian graphs arise in integer programming solutions to the traveling salesman problem: certain kinds of hypohamiltonian graphs define facets of the ''traveling salesman polytope'', a shape defined as the convex hull of the set of possible solutions to the traveling salesman problem, and these facets may ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Even Circuit Theorem
In extremal graph theory, the even circuit theorem is a result of Paul Erdős according to which an -vertex graph that does not have a simple cycle of length can only have edges. For instance, 4-cycle-free graphs have edges, 6-cycle-free graphs have edges, etc. History The result was stated without proof by Erdős in 1964. published the first proof, and strengthened the theorem to show that, for -vertex graphs with edges, all even cycle lengths between and occur.. Lower bounds The bound of Erdős's theorem is tight up to constant factors for some small values of ''k'': for ''k'' = 2, 3, or 5, there exist graphs with edges that have no -cycle. It is unknown for other than 2, 3, or 5 whether there exist graphs that have no -cycle but have edges, matching Erdős's upper bound. Only a weaker bound is known, according to which the number of edges can be for odd values of , or for even values of . Constant factors Because a 4-cycle is a complete bipartite graph, th ... [...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 SIGACT site The are [...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, |
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] |
Jean Dréville
Jean Dréville (20 September 1906 – 5 March 1997) was a French film director. He directed more than 40 films between 1928 and 1969. Selected filmography * ''Autour de L'Argent'' (1928) * '' A Man of Gold'' (1934) * '' The Chess Player'' (1938) * '' His Uncle from Normandy'' (1939) * '' President Haudecoeur'' (1940) * '' Annette and the Blonde Woman'' (1942) * '' A Cage of Nightingales'' (1945) * '' Return to Life'' (1949) * ''The Girl with the Whip'' (1952) * '' The Secret of the Mountain Lake'' (1952) * '' Endless Horizons'' (1953) * '' Queen Margot'' (1954) * '' Stopover in Orly'' (1955) * ''A Dog, a Mouse, and a Sputnik'' (1958) * '' Nights of Farewell'' (1965) * ''The Last of the Mohicans ''The Last of the Mohicans: A Narrative of 1757'' is a historical romance written by James Fenimore Cooper in 1826. It is the second book of the '' Leatherstocking Tales'' pentalogy and the best known to contemporary audiences. '' The Pathfind ...'' (1968) References Externa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Claridge
John Claridge (born 1944) is a British photographer, known for his work in advertising, black and white portraits in Soho and street photographs in the East End of London. Early life Claridge was born in Plaistow, London. His father worked in the docks, sold alcohol in New York during Prohibition and was a bare-knuckle boxer in the dock areas in both New York and the East End; Claridge also boxed. His mother was a shirt machinist working in Roman Road, Bow. Aged 8, Claridge saw a plastic camera at an East End funfair and had to have it. A few years later, he saved up enough money from his paper round in the London docks to buy a proper camera to record the world he was growing up in. From the age of 13, he started to buy jazz records, and it remained a lifetime obsession. He had no formal training as a photographer but aged 15, began working for McCann Erickson advertising agency in their Photography and Design department. He worked under Robert Brownjohn, the art director kn ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
