On uniform relationships between combinatorial problems

DOI10.1090/tran/6465WikidataQ59894937 ScholiaQ59894937MaRDI QIDQ2796522

Paul Shafer, Jeffry L. Hirst, Damir D. Dzhafarov, Joseph R. Mileti, François G. Dorais

Publication date: 29 March 2016

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.0157

Mathematics Subject Classification ID

05D15: Transversal (matching) theory

03B30: Foundations of classical theories (including reverse mathematics)

05D10: Ramsey theory

03D80: Applications of computability and recursion theory

03F35: Second- and higher-order arithmetic and fragments

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

03D32: Algorithmic randomness and dimension

Related Items

On the strength of marriage theorems and uniformity, Probabilistic computability and choice, Universality, optimality, and randomness deficiency