Pages that link to "Item:Q929393"
From MaRDI portal
The following pages link to Lectures on advances in combinatorics (Q929393):
Displaying 17 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207) (← links)
- On the stability of the Erdös-Ko-Rado theorem (Q498190) (← links)
- Combinatorial methods and models. Rudolf Ahlswede's lectures on information theory 4. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm (Q526571) (← links)
- BSC reliability function under list decoding (Q764083) (← links)
- Intersection theorem for finite permutations (Q764250) (← links)
- Remark on the reliability function of a symmetric channel under list decoding (Q764384) (← links)
- A proof of one correlation inequality (Q1049392) (← links)
- Proof of two conjectures on correlation inequalities for one class of monotone functions (Q2263011) (← links)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
- The weighted complete intersection theorem (Q2363359) (← links)
- A generalization of Lee codes (Q2436575) (← links)
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861) (← links)
- Complete intersection problems for finite permutations (Q2857335) (← links)
- Advances on extremal problems in number theory and combinatorics (Q4408032) (← links)
- On linear diameter perfect Lee codes with distance 6 (Q6071958) (← links)
- Correlation inequalities for linear extensions (Q6634747) (← links)
