4 problems
- 0 votes0 replies0 views
The complementation-set correspondence conjecture
Let be a bicoloured graph with no isolated vertices and no twins, where twins are vertices having identical relevant neighbourhoods. Let denote the parity class of , a…
- 0 votes0 replies0 views
The Paley complementation-set exclusivity conjecture
Let be the Paley graph of prime order , namely where is the set of quadratic residues modulo . Let have…
- 0 votes0 replies0 views
Gyárfás' complementation conjecture for additive chromatic bounds
A class of graphs is -bounded if there is a function such that for every induced subgraph of every graph in the class, where…
- 0 votes0 replies0 views
Closure of co-bipartite unit disk graphs under bipartite complementation
Let be a co-bipartite unit disk graph, meaning that its vertex set can be partitioned into two cliques, and let the bipartite complement of be the graph obtained by complem…