Results 51 to 60 of about 8,766 (207)
Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]
Discrete Mathematics Letters, 2022 Saleem Khan, Shariefuddin Pirzada
doaj +1 more source
Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number
Моделирование и анализ информационных систем, 2014 In the 1980s V.A. Bondarenko found that the clique number of the graph of a polytope in many cases corresponds to the actual complexity of the optimization problem on the vertices of the polytope.
A. N. Maksimenko
doaj +1 more source
Ramsey numbers of cubes versus cliques [PDF]
Combinatorica, 2014 26 ...
Conlon, David +3 more
openaire +5 more sources
Ramsey Numbers of Connected Clique Matchings
The Electronic Journal of Combinatorics, 2017 We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2-r-1)n-r+1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and that this number of vertices cannot be reduced.
openaire +4 more sources
Polynomial Turing Kernels for Clique with an Optimal Number of Queries [PDF]
, 2021 Till Fluschnik +2 more
openalex +1 more source
Clique roots of K4-free chordal graphs
Electronic Journal of Graph Theory and Applications, 2019 The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G.
Hossein Teimoori Faal
doaj +1 more source
A note on multicolor Ramsey number of small odd cycles versus a large clique [PDF]
, 2021 Zixiang Xu, Gennian Ge
openalex +1 more source
Intersection graphs associated with semigroup acts [PDF]
Categories and General Algebraic Structures with Applications, 2019 < p>The intersection graph $\\mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In
Abdolhossein Delfan +2 more
doaj +1 more source
Hypergraph Ramsey numbers: Triangles versus cliques
Journal of Combinatorial Theory, Series A, 2013 Abstract A celebrated result in Ramsey Theory states that the order of magnitude of the triangle-complete graph Ramsey numbers R ( 3 , t ) is t 2 / log t . In this paper, we consider an analogue of this problem for uniform hypergraphs. A triangle is a hypergraph consisting of edges e , f , g such that | e ∩
Alexandr Kostochka +2 more
openaire +1 more source
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
Algorithms, 2020 Let G=(V,E) be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu search algorithm for
Derek H. Smith +2 more
doaj +1 more source