Reverse mathematics and colorings of hypergraphs

DOI10.1007/s00153-018-0654-zzbMath1477.03029arXiv1804.09638OpenAlexW2962720699WikidataQ128896494 ScholiaQ128896494MaRDI QIDQ2312088

Caleb Davis, Tim Ransom, Jake Pardo, Jeffry L. Hirst

Publication date: 4 July 2019

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphvertex coloringreverse mathematics

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION
• On principles between ∑1- and ∑2-induction, and monotone enumerations
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles equivalent to weak induction
• Conflict-Free Coloring and its Applications

This page was built for publication: Reverse mathematics and colorings of hypergraphs