Results 71 to 80 of about 8,623,913 (295)
On the Number of Monochromatic Cliques in a Graph
The Electronic Journal of CombinatoricsNordhaus and Gaddum proved sharp upper and lower bounds on the sum and product of the chromatic number of a graph and its complement. Over the years, similar inequalities have been shown for a plenitude of different graph invariants. In this paper, we consider such inequalities for the number of cliques (complete subgraphs) in a graph $G$, denoted $k(G)
Deepak Bal, Jonathan Cutler, Luke Pebody
openaire +1 more source
On clique numbers of colored mixed graphs
Discrete Applied Mathematics, 2023 An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m,n)-graph H is a vertex mapping that preserves adjacency, the type thereto and the direction.
Dipayan Chakraborty +4 more
openaire +3 more sources
Air spécialement composé pour la clique de Rostrenen
, 1949 Indexation : biniou, tambour, bombarde Description analytique : Air spécialement composé pour la clique de ...
Musée national des arts et traditions populaires (Paris) +1 more
core +1 more source
Clique partitions and clique coverings [PDF]
, 1988 Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow cn2 times as fast as the clique covering number, where c is at least 164.
Erd'́os, Paul +2 more
core +1 more source
American Journal of Botany, EarlyView.Abstract Premise The origin of endemic species in the European Alps is commonly attributed to the climatic oscillations of the Quaternary. Moehringia sect. Moehringia, with 12 of 15 species endemic to the Alps and mostly restricted to well‐known glacial refugia, is a prime system for investigating the diversification of a lineage originating in the ...
Joachim W. Kadereit +4 more
wiley +1 more source
Independence Number of Graphs with a Prescribed Number of Cliques
The Electronic Journal of Combinatorics, 2019 We consider the following problem posed by Erdős in 1962. Suppose that $G$ is an $n$-vertex graph where the number of $s$-cliques in $G$ is $t$. How small can the independence number of $G$ be? Our main result suggests that for fixed $s$, the smallest possible independence number undergoes a transition at $t=n^{s/2+o(1)}$. In the case of triangles ($s=
Tom Bohman, Dhruv Mubayi
openaire +4 more sources
Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms
, 2011 It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research +4 more
core +1 more source
Animal Models and Experimental Medicine, EarlyView.At the genomic level, a large number of differentially expressed genes (DEGs) and aging‐related DEGs have been screened. Ten hub genes, such as IFNγ and IRF7, have been identified and shown potential value in the diagnosis of PD, holding promise as novel biomarkers to facilitate early and precise diagnosis.
Haojie Wu +3 more
wiley +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
The maximum number of q-cliques in a graph with no p-clique
Discrete Mathematics, 1976 AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with no p-clique. Turán, in 1941, determined ƒ(n, p, 2) for all n and p. For each n and p, he found the unique graph which attains this maximum. In this paper we determine ƒ(n, p, q) for all values of n, p and q.
openaire +1 more source