Some nonstandard Ramsey like applications

DOI10.1016/0304-3975(84)90110-5zbMath0546.05044OpenAlexW1591754212MaRDI QIDQ798332

Jaroslav Nešetřil

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90110-5

zbMATH Keywords

applicationsBoolean functionscombinatorial gamesRamsey theorem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Game theory (91A99) Boolean algebras (Boolean rings) (06E99) Graph theory (05C99) Sequences and sets (11B99)

Related Items (2)

Some remarks on natural orders for combinatorial cubes ⋮ Erdős-Szekeres theorem for multidimensional arrays

Cites Work

• There is no fast method for finding monochromatic complete subgraphs
• Canonizing ordering theorems for Hales Jewett structures
• Lower bounds for the size of expressions for certain functions in d-ary logic
• On the multiplicative representation of integers
• Two Proofs in Combinatorial Number Theory
• Should Tables Be Sorted?
• Accessible Independence Results for Peano Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some nonstandard Ramsey like applications