The following pages link to Endre Csóka (Q322326):
Displaying 21 items.
- Limits of some combinatorial problems (Q322327) (← links)
- An undecidability result on limits of sparse graphs (Q426892) (← links)
- (Q722347) (redirect page) (← links)
- Block partitions: an extended view (Q722349) (← links)
- Entropy and expansion (Q2028943) (← links)
- Upper bounds for the necklace folding problems (Q2171014) (← links)
- Invariant random perfect matchings in Cayley graphs (Q2357410) (← links)
- The extremal function for disconnected minors (Q2399354) (← links)
- The solution to an open problem for a caching game (Q2808489) (← links)
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
- Invariant Gaussian processes and independent sets on regular graphs of large girth (Q3192382) (← links)
- (Q5419954) (← links)
- On directed analogues of expander and hyperfinite graph sequences (Q5886316) (← links)
- On the graph limit question of Vera T. Sós (Q5890920) (← links)
- On the graph limit question of Vera T. Sós (Q5899550) (← links)
- Positive graphs (Q5899554) (← links)
- Locally common graphs (Q6046683) (← links)
- Upper bounds for the necklace folding problems (Q6341427) (← links)
- Borel version of the Local Lemma (Q6503229) (← links)
- Moser-Tardos Algorithm with small number of random bits (Q6505586) (← links)
- FIID homomorphisms and entropy inequalities (Q6736435) (← links)
