Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets

  • Miroslaw Truszczynski
  • , Zsolt Tuza

Producción científica: Articlerevisión exhaustiva

2 Citas (Scopus)

Resumen

Three formulations and various consequences of a compactness principle are given. For example it is shown that an infinite partially ordered set has the jump number at most k if and only if none of its finite subsets has the jump number greater than k. Other applications include Ramsey-type results on local colorings of hypergraphs.

Idioma originalEnglish
Páginas (desde-hasta)301-312
Número de páginas12
PublicaciónDiscrete Mathematics
Volumen103
N.º3
DOI
EstadoPublished - may 28 1992

Nota bibliográfica

Funding Information:
* Research supported in part by the ‘AKA’ Research Fund of the Hungarian Academy of Sciences and in part by University of Louisville.

Financiación

* Research supported in part by the ‘AKA’ Research Fund of the Hungarian Academy of Sciences and in part by University of Louisville.

Financiadores
University of Kentucky, University of Louisville
Magyar Tudományos Akadémia

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics

    Huella

    Profundice en los temas de investigación de 'Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets'. En conjunto forman una huella única.

    Citar esto