The following pages link to Gábor Simonyi (Q168587):
Displaying 50 items.
- Orientations making \(k\)-cycles cyclic (Q503634) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- (Q810527) (redirect page) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Local chromatic number, Ky Fan's theorem, and circular colorings (Q879165) (← links)
- Necklace bisection with one cut less than needed (Q1010671) (← links)
- On types of growth for graph-different permutations (Q1024371) (← links)
- A Sperner-type theorem and qualitative independence (Q1185884) (← links)
- Perfect couples of graphs (Q1196687) (← links)
- Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities (Q1279873) (← links)
- On the optimal structure of recovering set pairs in lattices: The sandglass conjecture (Q1322202) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Intersecting set systems and graphic matroids (Q1584250) (← links)
- (Q1823915) (redirect page) (← links)
- Coding for write-unidirectional memories and conflict resolution (Q1823916) (← links)
- Entropy splitting hypergraphs (Q1924130) (← links)
- Colourful theorems and indices of homomorphism complexes (Q1953386) (← links)
- Partitioning transitive tournaments into isomorphic digraphs (Q2035088) (← links)
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
- Asymptotic values of the Hall-ratio for graph powers (Q2433717) (← links)
- Local chromatic number of quadrangulations of surfaces (Q2439834) (← links)
- Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
- Local chromatic number and Sperner capacity (Q2565689) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- Perfect graphs and graph entropy: An updated survey (Q2758342) (← links)
- Perfection, imperfection, and graph entropy (Q2816136) (← links)
- Permutation capacities and oriented infinite paths (Q2857343) (← links)
- Families of very different paths (Q2857400) (← links)
- Families of graph-different Hamilton paths (Q2902904) (← links)
- Dilworth Rate: A Generalization of Witsenhausen’s Zero-Error Rate for Directed Graphs (Q2978761) (← links)
- On directed local chromatic number, shift graphs, and Borsuk-like graphs (Q3067063) (← links)
- Separating Partition Systems and Locally Different Sequences (Q3211322) (← links)
- Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory (Q3360785) (← links)
- On Witsenhausen's zero-error rate for multiple sources (Q3547637) (← links)
- (Q3576721) (← links)
- Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
- Graph-Different Permutations (Q3629458) (← links)
- On write-unidirectional memory codes (Q3832472) (← links)
- Zero-error capacities and very different sequences (Q3977587) (← links)
- (Q4263475) (← links)
- (Q4263485) (← links)
- Recovering Set Systems and Graph Entropy (Q4372996) (← links)
- Edge colorings of complete graphs without tricolored triangles (Q4474285) (← links)
- Gallai colorings and domination in multipartite digraphs (Q4650182) (← links)
- Connected matchings and Hadwiger's conjecture (Q4680576) (← links)
- (Q4840778) (← links)
- (Q4871067) (← links)
- (Q4878288) (← links)
- Relations between the Local Chromatic Number and Its Directed Version (Q5265337) (← links)
