Some nonstandard Ramsey like applications
From MaRDI portal
Publication:798332
DOI10.1016/0304-3975(84)90110-5zbMATH Open0546.05044OpenAlexW1591754212MaRDI QIDQ798332FDOQ798332
Authors: J. 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
Recommendations
Game theory (91A99) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Sequences and sets (11B99) Boolean algebras (Boolean rings) (06E99)
Cites Work
- Title not available (Why is that?)
- Should Tables Be Sorted?
- Accessible Independence Results for Peano Arithmetic
- Two Proofs in Combinatorial Number Theory
- On the multiplicative representation of integers
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Some nonstandard Ramsey like applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798332)