The following pages link to Hanno Lefmann (Q213130):
Displaying 50 items.
- A rainbow Erdős-Rothschild problem (Q322299) (← links)
- Edge-colorings avoiding fixed rainbow stars (Q324811) (← links)
- Graphs on affine and linear spaces and Deuber sets (Q396752) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- A structural result for hypergraphs with many restricted edge colorings (Q547872) (← links)
- Partition regularity of \((M,P,C)\)-systems (Q690023) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← links)
- On the independence number of non-uniform uncrowded hypergraphs (Q776287) (← links)
- (Q801110) (redirect page) (← links)
- A remark on infinite arithmetic progressions (Q801111) (← links)
- An extremal problem for Graham-Rothschild parameter words (Q803178) (← links)
- On families in finite lattices (Q810551) (← links)
- Large triangles in the \(d\)-dimensional unit cube (Q860817) (← links)
- Distributions of points in \(d\) dimensions and large \(k\) -point simplices (Q958238) (← links)
- Point sets in the unit square and large areas of convex hulls of subsets of points (Q1016043) (← links)
- Generalizations of Heilbronn's triangle problem (Q1039441) (← links)
- A canonical version for partition regular systems of linear equations (Q1069938) (← links)
- A note on monoton waves (Q1119693) (← links)
- Non \(t\)-intersecting families of linear spaces over \(GF(q)\) (Q1176745) (← links)
- On partition regular systems of equations (Q1177946) (← links)
- Monochromatic vs multicolored paths (Q1205343) (← links)
- Rigid linear binary codes (Q1207772) (← links)
- Rado's theorem for commutative rings (Q1323832) (← links)
- On canonical Ramsey numbers for complete graphs versus paths (Q1325270) (← links)
- Monochromatic and zero-sum sets of nondecreasing diameter (Q1343772) (← links)
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\) (Q1343782) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
- Canonical partition relations for \((m,p,c)\)-systems (Q1356665) (← links)
- On sparse parity check matrices (Q1368732) (← links)
- PAC-learning from general examples (Q1392015) (← links)
- Coloring arcs of convex sets (Q1567612) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- Stability of extremal hypergraphs with applications to an edge-coloring problem (Q1689923) (← links)
- Estimating the distance to a hereditary graph property (Q1689980) (← links)
- On Erdős-Rado numbers (Q1842571) (← links)
- Infinite partition regular matrices (Q1900183) (← links)
- Point sets with distinct distances (Q1900187) (← links)
- Multicolored subsets in colored hypergraphs (Q1914009) (← links)
- Computing sparse approximations deterministically (Q1915603) (← links)
- On the degree of regularity of some equations (Q1916096) (← links)
- An extension of the rainbow Erdős-Rothschild problem (Q2032865) (← links)
- Remarks on an edge-coloring problem (Q2132387) (← links)
- On graphs with a large number of edge-colorings avoiding a rainbow triangle (Q2403696) (← links)
- Distributions of points in the unit square and large \(k\)-gons (Q2427543) (← links)
- On Heilbronn's problem in higher dimension (Q2494423) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- Graphs with many edge-colorings such that complete graphs are rainbow (Q2700627) (← links)
- On \(k\)-partite subgraphs (Q2713662) (← links)
- Kneser colorings of uniform hypergraphs (Q2851466) (← links)
