The following pages link to János Körner (Q168586):
Displaying 50 items.
- Connector families of graphs (Q489306) (← links)
- Forbiddance and capacity (Q659716) (← links)
- (Q798655) (redirect page) (← links)
- Odd and even Hamming spheres also have minimum boundary (Q798656) (← links)
- Selecting non-consecutive balls arranged in many lines (Q802558) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- On types of growth for graph-different permutations (Q1024371) (← links)
- Addendum to ``Odd and even Hamming spheres also have minimum boundary'' (Q1077417) (← links)
- A Sperner-type theorem and qualitative independence (Q1185884) (← links)
- Search problems for two irregular coins with incomplete feedback: The underweight model (Q1192952) (← links)
- Perfect couples of graphs (Q1196687) (← links)
- Qualitative independence and Sperner problems for directed graphs (Q1199993) (← links)
- On the odd cycles of normal graphs (Q1293197) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Tiling Hamming space with few spheres (Q1374207) (← links)
- On clique growth in products of directed graphs (Q1385297) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Cancellative pairs of families of sets (Q1893950) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Divergent permutations (Q2306003) (← links)
- Sperner capacities (Q2366215) (← links)
- Tight packings of Hamming spheres (Q2563715) (← links)
- Local chromatic number and Sperner capacity (Q2565689) (← links)
- Compact Representations of the Intersection Structure of Families of Finite Sets (Q2706199) (← links)
- String Quartets in Binary (Q2709843) (← links)
- Locally Thin Set Families (Q2711614) (← links)
- Self-Similarity Bounds for Locally Thin Set Families (Q2757074) (← links)
- A Note on Counting Very Different Sequences (Q2777896) (← links)
- (Q2857343) (← links)
- (Q2857400) (← links)
- Degree-Doubling Graph Families (Q2870523) (← links)
- Families of Graph-different Hamilton Paths (Q2902904) (← links)
- Zero-Error Capacity of Binary Channels With Memory (Q2977028) (← links)
- Successive encoding of correlated sources (Q3041074) (← links)
- Separating Partition Systems and Locally Different Sequences (Q3211322) (← links)
- (Q3312141) (← links)
- OPEC or a basic problem in source networks (Q3329358) (← links)
- On the capacity of uniform hypergraphs (Q3478436) (← links)
- Codes for a long silence (Q3546859) (← links)
- Graph-Different Permutations (Q3629458) (← links)
- (Q3669298) (← links)
- (Q3686615) (← links)
- Fredman–Komlós bounds and information theory (Q3739153) (← links)
- (Q3773812) (← links)
- (Q3815240) (← links)
- Towards a general theory of source networks (Q3869237) (← links)
- Universally attainable error exponents for broadcast channels with degraded message sets (Q3919594) (← links)
- Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.) (Q3921142) (← links)
- Graph decomposition: A new key to coding theorems (Q3931313) (← links)
