Works by P. Komjáth ( view other items matching `P. Komjáth`, view all matches )
Disambiguations:
Péter Komjáth [6]P. Komjáth [3]

9 found
Sort by:
  1. Matthew Foreman & Peter Komjath (2005). The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah. Journal of Mathematical Logic 5 (01):99-147.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Mirna Džamonja, Péter Komjáth & Charles Morgan (2004). Wild Edge Colourings of Graphs. Journal of Symbolic Logic 69 (1):255 - 264.
    We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ many colours has a g-colour class on which c takes every value. The paper also contains some generalisations of the above statement in which $\mu^{+}$ is replaced (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Péter Komjáth & Saharon Shelah (2000). Two Consistency Results on Set Mappings. Journal of Symbolic Logic 65 (1):333-338.
    It is consistent that there is a set mapping from the four-tuples of ω n into the finite subsets with no free subsets of size t n for some natural number t n . For any $n it is consistent that there is a set mapping from the pairs of ω n into the finite subsets with no infinite free sets. For any $n it is consistent that there is a set mapping from the pairs of ω n into ω (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. Péter Komjáth (1999). Some Remarks on the Partition Calculus of Ordinals. Journal of Symbolic Logic 64 (2):436-442.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. P. Komjáth (1991). A Set Mapping with No Infinite Free Subsets. Journal of Symbolic Logic 56 (4):1400-1402.
    It is consistent that there exists a set mapping $F: \lbrack\omega_2\rbrack^2 \rightarrow \lbrack\omega_2\rbrack^{<\omega}$ such that $F(\alpha, \beta) \subseteq \alpha$ for $\alpha < \beta < \omega_2$ and there is no infinite free subset for F. This solves a problem of A. Hajnal and A. Mate.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. P. Komjath (1991). A Set Mapping with No Infinite Free Subsets. Journal of Symbolic Logic 56 (4).
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Péter Komjáth & Saharon Shelah (1988). Forcing Constructions for Uncountably Chromatic Graphs. Journal of Symbolic Logic 53 (3):696-707.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. P. Komjáth (1987). Morasses and the Lévy-Collapse. Journal of Symbolic Logic 52 (1):111-115.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Péter Komjáth (1986). Stationary Reflection for Uncountable Cofinality. Journal of Symbolic Logic 51 (1):147-151.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation