In recent work, Alladi, Andrews and Gordon discovered a key identity which captures several fundamental theorems in partition theory. In this paper we construct a combinatorial bijection which ...
In the context of the theory and computation of fixed points of continuous mappings, researchers have developed combinatorial analogs of Brouwer's fixed-point theorem on the simplex and on the n-cube.
Reverse mathematics is a vibrant programme in mathematical logic that investigates the axioms necessary to establish fundamental theorems throughout mathematics. Central to this endeavour are ...
Abstract: The story begins with Urysohn's universal complete separable metric space and its remarkably rich isometry group (1924), and a fundamental combinatorial theorem due to Ramsey (1930). The ...
The Bristol One-Day Meeting in Combinatorics is an annual conference in Bristol with talks on a wide variety of topics within Combinatorics. Talks will cover recent developments in extremal and ...
Late last January, University of Cambridge mathematician Tim Gowers decided to run a little experiment. Was it possible, he wondered, for a large number of mathematicians to collaborate openly on the ...
One of the highlights in the Robertson-Seymour theory on graph minors is the finiteness (for each fixed surface S) of the set of the minimal forbidden minors for S. Theorem 7.0.1 (Robertson and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback