The following pages link to Péter Komjáth (Q178041):
Displaying 50 items.
- The list-chromatic number of infinite graphs (Q375873) (← links)
- A note on chromatic number and connectivity of infinite graphs (Q375903) (← links)
- Consistently \(\mathcal P(\omega_{1})\) is the union of less than \(2^{\aleph _1}\) strongly independent families (Q522332) (← links)
- Sharp concentration of the number of submaps in random planar triangulations (Q558223) (← links)
- (Q579260) (redirect page) (← links)
- Ramsey-type results for metric spaces (Q579261) (← links)
- Axiom of choice and chromatic number: Examples on the plane (Q598462) (← links)
- The list-chromatic number of infinite graphs defined on Euclidean spaces (Q633199) (← links)
- Conflict free colorings of nonuniform systems of infinite sets (Q663080) (← links)
- The complete intersection theorem for systems of finite sets (Q674615) (← links)
- On the minimal covering of infinite sets (Q686424) (← links)
- (Q688851) (redirect page) (← links)
- Happy families and completely Ramsey sets (Q688852) (← links)
- The two points theorem of Mazurkiewicz (Q696919) (← links)
- On the value of a random minimum weight Steiner tree (Q705741) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\) (Q756706) (← links)
- On the consistency strength of ''accessible'' Jonsson cardinals and of the weak Chang conjecture (Q761448) (← links)
- The exact bound in the Erdős-Ko-Rado theorem (Q761464) (← links)
- On disjointly representable sets (Q790112) (← links)
- Antichains in the set of subsets of a multiset (Q790113) (← links)
- Consequences of the Cantor construction (Q790808) (← links)
- Unavoidable stars in 3-graphs (Q793053) (← links)
- A generalization of the Kruskal-Katona theorem (Q793732) (← links)
- Families close to disjoint ones (Q794639) (← links)
- What must and what need not be contained in a graph of uncountable chromatic number? (Q794660) (← links)
- Selecting k objects from a cycle with p pairs of separation s (Q797581) (← links)
- On universal graphs without instances of CH (Q801052) (← links)
- The structure of rectangle families dividing the plane into maximum number of atoms (Q801060) (← links)
- Set systems with finite chromatic number (Q805616) (← links)
- Disjoint subsets of integers having a constant sum (Q809077) (← links)
- Martin's axiom and spanning trees of infinite graphs (Q810051) (← links)
- On the discrepancy of coloring finite sets (Q810057) (← links)
- Notes on singular cardinal combinatorics (Q816288) (← links)
- Covering for category and combinatorics on \(P_\kappa(\lambda)\) (Q819562) (← links)
- Monocolored topological complete graphs in colorings of uncountable complete graphs (Q822604) (← links)
- Chang's conjecture for \(\aleph_\omega\) (Q910400) (← links)
- An arithmetic of complete permutations with constraints. II: Case studies (Q911592) (← links)
- Results on the generic Kurepa hypothesis (Q915727) (← links)
- Consistency of Menas's conjecture (Q916655) (← links)
- Universal graphs without instances of CH: Revisited (Q920985) (← links)
- (Q949812) (redirect page) (← links)
- Obligatory subsystems of triple systems (Q949814) (← links)
- Colorful flowers (Q1013831) (← links)
- An uncountably chromatic triple system (Q1046824) (← links)
- On the limit superior of analytic sets (Q1061122) (← links)
- A measure of thickness for families of sets (Q1069936) (← links)
- Non-trivial intersecting families (Q1069937) (← links)
- Coloring of universal graphs (Q1073812) (← links)
- Coloring graphs with locally few colors (Q1074595) (← links)
