The following pages link to Martin Aigner (Q495333):
Displaying 50 items.
- Graph theory. An introduction from the 4-color problem (Q495334) (← links)
- The plurality problem with three colors and more. (Q557833) (← links)
- Searching for counterfeit coins (Q675884) (← links)
- Finding the maximum and minimum (Q678861) (← links)
- A game of cops and robbers (Q793755) (← links)
- Richard Rado 1906-1989 (Q809988) (← links)
- Hook-free colorings and a problem of Hanson (Q920999) (← links)
- Mr. Sum and Mr. Product (Q934742) (← links)
- A note on merging (Q1068860) (← links)
- Search problems on graphs (Q1082080) (← links)
- Determining defectives in a linear order (Q1085612) (← links)
- On the representing number of intersecting families (Q1093635) (← links)
- Sorting by insertion of leading elements (Q1096394) (← links)
- The total interval number of a graph (Q1119605) (← links)
- Producing posets (Q1151047) (← links)
- Selecting the top three elements (Q1171878) (← links)
- Partitioning a power set into union-free classes (Q1176718) (← links)
- Fractals of regular polygons (Q1182559) (← links)
- Symmetrische Zerlegung von Kettenprodukten (Q1226101) (← links)
- Metrischer Filter distributiver Verbände (Q1229896) (← links)
- Reziprozitätsgesetze in der kombinatorischen Zähltheorie (Q1238811) (← links)
- Uniform binary geometries (Q1245968) (← links)
- The double selection problem (Q1262124) (← links)
- Sum-difference sequences and Catalan numbers (Q1291092) (← links)
- Catalan-like numbers and determinants (Q1296752) (← links)
- A characterization of the Bell numbers (Q1301842) (← links)
- Codings of graphs with binary edge labels (Q1323484) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- The Penrose polynomial of a plane graph (Q1359525) (← links)
- Interlace polynomials (Q1418963) (← links)
- Variants of the majority problem. (Q1422403) (← links)
- Penrose's ideas on the 4-color-problem (Q1587365) (← links)
- Binomial determinants and lattice (Q1818425) (← links)
- The Penrose polynomial of binary matroids (Q1841247) (← links)
- Bounds on the size of merging networks (Q1897347) (← links)
- Ulam's liar problem (Q1897482) (← links)
- Searching for acyclic orientations of graphs (Q1898338) (← links)
- Knots, spin models and graphs (Q1901476) (← links)
- Searching with lies (Q1913996) (← links)
- Lexicographic matching in Boolean algebras (Q2264666) (← links)
- Enumeration via ballot numbers (Q2427513) (← links)
- Obituary: Memories of Paul Erdős (Q2451159) (← links)
- ``Good proofs are proofs that make us wiser.'' Interview with Yuri I. Manin (Q2451185) (← links)
- A new proof of the four color theorem (Q2452499) (← links)
- On the tetrahedral graph (Q2527467) (← links)
- On the linegraph of a directed-graph (Q2527799) (← links)
- Graphs and partial orderings (Q2535845) (← links)
- Vertauschbarkeit von Partitionen. (Commutability of positions.) (Q2549325) (← links)
- Uniformität des Verbandes der Partitionen (Q2559495) (← links)
- Combinatorial theory. (Q2565249) (← links)
