The Big-line-big-clique conjecture is a concept in the field of combinatorics, more specifically in graph theory. It conjectures properties related to the structure and size of certain types of graphs, particularly concerning the relationships between cliques and line graphs. A clique in a graph is a subset of vertices such that every two distinct vertices in the subset are adjacent.
Articles by others on the same topic
There are currently no matching articles.