The following pages link to Péter Komjáth (Q178041):
Displayed 50 items.
- Two selection problems revisited (Q1076671) (← links)
- On `\(k\)-sets' in the plane (Q1077725) (← links)
- Can you take Solovay's inaccessible away? (Q1078178) (← links)
- The strength of measurability hypotheses (Q1081600) (← links)
- On measure and category (Q1081601) (← links)
- Comparing almost-disjoint families (Q1087541) (← links)
- An infinite version of Ryser's inequality (Q1087875) (← links)
- Some higher-gap examples in combinatorial set theory (Q1103617) (← links)
- On k-transversals (Q1106212) (← links)
- On multiset k-families (Q1106244) (← links)
- Some possible new directions for combinatorial matrix analysis (Q1109784) (← links)
- Some results on Specker's problem (Q1110506) (← links)
- An arithmetic of complete permutations with constraints. I: An exposition of the general theory (Q1110508) (← links)
- Partitioning pairs of countable ordinals (Q1111550) (← links)
- Cycles generated by sequential iterations (Q1111552) (← links)
- Infinite combinatorics and definability (Q1117219) (← links)
- Minimal coding (Q1117220) (← links)
- Filter spaces: Towards a unified theory of large cardinal and embedding axioms (Q1117925) (← links)
- Consistency results on infinite graphs (Q1117946) (← links)
- Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587) (← links)
- Some universal graphs (Q1119949) (← links)
- The negation of the singular cardinal hypothesis from \(o(\kappa)=\kappa ^{++}\) (Q1120570) (← links)
- Borel ideals vs. Borel sets of countable relations and trees (Q1120573) (← links)
- A simplified construction of nonlinear Davenport-Schinzel sequences (Q1120575) (← links)
- Connectivity and chromatic number of infinite graphs (Q1120588) (← links)
- Expanders that beat the eigenvalue bound: Explicit construction and applications (Q1125612) (← links)
- Graphs whose circular chromatic number equals the chromatic number (Q1125613) (← links)
- Ear decompositions of matching covered graphs (Q1125615) (← links)
- Graph colorings and the axiom of choice (Q1183089) (← links)
- Universal elements and the complexity of certain classes of infinite graphs (Q1191925) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
- On a Ramsey-theoretic property of orders (Q1199999) (← links)
- Sharpening the LYM inequality (Q1200274) (← links)
- From wqo to bqo, via Ellentuck's theorem (Q1201238) (← links)
- On cross-intersecting families (Q1201261) (← links)
- Unprovable combinatorial statements (Q1201266) (← links)
- Forcing axioms and stationary sets (Q1201333) (← links)
- Item:Q178041 (redirect page) (← links)
- The admissible trace problem for E-unitary inverse semigroups (Q1247493) (← links)
- A strongly non-Ramsey order type (Q1271912) (← links)
- Covering odd cycles (Q1272187) (← links)
- On the minimal number of edges in color-critical graphs (Q1272188) (← links)
- Graphs drawn with few crossings per edge (Q1272189) (← links)
- A variant of the classical Ramsey problem (Q1280270) (← links)
- Colouring a graph frugally (Q1280272) (← links)
- The Colin de Verdière number and sphere representations of a graph (Q1280274) (← links)
- How to decrease the diameter of triangle-free graphs (Q1307443) (← links)
- \(3n-5\) edges do force a subdivision of \(K_5\) (Q1307446) (← links)
- A \(\Pi_ 2^ 1\) singleton incompatible with \(0^ \#\) (Q1315458) (← links)
- The Erdős-Ko-Rado theorem for small families (Q1320390) (← links)