18 citations · 23 across the 14 of their papers we have counts for
19 papers
Critical subgraphs of Schrijver graphs for the fractional chromatic number
Anna Gujgiczer, Gábor Simonyi
Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional chromatic number but Schrijver…
Structured Codes of Graphs
Noga Alon, Anna Gujgiczer, János Körner +2
We investigate the maximum size of graph families on a common vertex set of cardinality such that the symmetric difference of the edge sets of any two members of the family sat…
On multichromatic numbers of widely colorable graphs
Anna Gujgiczer, Gábor Simonyi
A coloring is called -wide if no walk of length connects vertices of the same color. A graph is -widely colorable with colors if and only if it admits a homomorphi…
Shannon capacity and the categorical product
Gábor Simonyi
Shannon OR-capacity of a graph , that is the traditionally more often used Shannon AND-capacity of the complementary graph, is a homomorphism monotone graph para…
On colorful edge triples in edge-colored complete graphs
Gábor Simonyi
An edge-coloring of the complete graph we call -caring if it leaves no -subgraph of monochromatic and at the same time every subset of vertices contains…
Partitioning transitive tournaments into isomorphic digraphs
Attila Sali, Gábor Simonyi, Gábor Tardos
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphical…