roveac.counter_checker

Counter Checkers

This module provides a consolidated CounterChecker class, which defines methods to determine if a graph is a Ramsey counterexample using various checking approaches.

Classes

CounterChecker: Class for checking if a candidate graph is a Ramsey counterexample using different strategies.

Classes

CounterChecker()

Class for checking if a candidate is a Ramsey counterexample.

class roveac.counter_checker.CounterChecker

Class for checking if a candidate is a Ramsey counterexample.

Methods

check(kwargs) -> bool: Checks if a given graph is a Ramsey counterexample.
has_clique_of_size_k(G: nx.Graph, k: int) -> bool: Checks if the graph G has a clique of size k.
has_independent_set_of_size_k(G: nx.Graph, k: int) -> bool: Checks if the graph G has an independent set of size k.

classmethod check(**kwargs) → bool

Check if the given graph G is a Ramsey counterexample using the specified method.

Parameters

kwargsdict: Keyword arguments containing required parameters based on the chosen method.

Returns

bool: True if the graph is a counterexample, False otherwise.

static has_clique_of_size_k(G: Graph, k: int) → bool

Check if the graph G has a clique of size k.

Parameters

Gnx.Graph: The graph to check for the presence of a clique.
kint: The size of the clique to search for.

Returns

bool: True if the graph has a clique of the specified size, False otherwise.

static has_independent_set_of_size_k(G: Graph, k: int) → bool

Check if the graph G has an independent set of size k.

Parameters

Gnx.Graph: The graph to check for an independent set.
kint: The size of the independent set to search for.

Returns

bool: True if the graph has an independent set of the specified size, False otherwise.