The following pages link to P. Erdős (Q6480801):
Displaying 50 items.
- Local constraints ensuring small representing sets (Q804606) (← links)
- How to make a graph bipartite (Q805628) (← links)
- On sums of a Sidon-sequence (Q807658) (← links)
- Distinct distances determined by subsets of a point set in space (Q808426) (← links)
- On the graph of large distances (Q908937) (← links)
- On two additive problems (Q911638) (← links)
- Colouring prime distance graphs (Q912118) (← links)
- Quasi-progressions and descending waves (Q912913) (← links)
- A new law of iterated logarithm (Q923479) (← links)
- On a problem of Oppenheim concerning ''Factorisatio Numerorum'' (Q1050397) (← links)
- Arithmetical properties of permutations of integers (Q1053743) (← links)
- Finite linear spaces and projective planes (Q1055005) (← links)
- On almost divisibility properties of sequences of integers. I (Q1056784) (← links)
- Chromatic number of finite and infinite graphs and hypergraphs (Q1059084) (← links)
- Problems and results on additive properties of general sequences. I (Q1061166) (← links)
- Combinatorial set theory: Partition relations for cardinals (Q1062673) (← links)
- On locally repeated values of certain arithmetic functions. I (Q1063027) (← links)
- On 2-designs (Q1063603) (← links)
- A note on the interval number of a graph (Q1065014) (← links)
- The closed linear span of \(\{x^k-c_k\}_1^{\infty}\) (Q1065304) (← links)
- Quantitative forms of a theorem of Hilbert (Q1065804) (← links)
- Entire functions bounded outside a finite area (Q1066305) (← links)
- E. Straus (1921--1983) (Q1068067) (← links)
- Problems and results on consecutive integers and prime factors of binomial coefficients (Q1068125) (← links)
- An application of graph theory to additive number theory (Q1068128) (← links)
- Clique numbers of graphs (Q1071785) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- Coloring graphs with locally few colors (Q1074595) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Multipartite graph-sparse graph Ramsey numbers (Q1076043) (← links)
- On some metric and combinatorial geometric problems (Q1077726) (← links)
- On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
- Problems and results on additive properties of general sequences. V (Q1078608) (← links)
- Maximum induced trees in graphs (Q1082351) (← links)
- On locally repeated values of certain arithmetic functions. II (Q1086612) (← links)
- Goodness of trees for generalized books (Q1087890) (← links)
- On the enumeration of finite groups (Q1087908) (← links)
- Problems and results on additive properties of general sequences. II (Q1090363) (← links)
- A Ramsey problem of Harary on graphs with prescribed size (Q1092061) (← links)
- An extremum problem concerning algebraic polynomials (Q1092187) (← links)
- On the representing number of intersecting families (Q1093635) (← links)
- Sumsets containing infinite arithmetic progressions (Q1095969) (← links)
- On nilpotent but not abelian groups and abelian but not cyclic groups (Q1097304) (← links)
- Partitions of bases into disjoint unions of bases (Q1103000) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- Minimal asymptotic bases with prescribed densities (Q1106265) (← links)
- Random walks on \(Z^n_2\) (Q1106556) (← links)
- On admissible constellations of consecutive primes (Q1109061) (← links)
- On the area of the circles covered by a random walk (Q1109422) (← links)
- Extremal problems on permutations under cyclic equivalence (Q1109772) (← links)
