AbstractIn this paper we study the maximalt-cliques of theq-analog of the Johnson GraphJq(n, k)with asymptotically large size. Lettbe an integer with 2≤t<k.For a fixed constantc>0, there existsn*=n*(q, k, t, c)such that ifn>n*,then the maximalt-cliques ofJq(n, k)with size greater thancq(n−k)(t−1)can be classified into four groups up to isomorphism
We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of...
AbstractNew upper bounds for the size of minimal maximal k-cliques are obtained. We show (i) m(k)⩽k5...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
AbstractIn this paper we study the maximalt-cliques of theq-analog of the Johnson GraphJq(n, k)with ...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
AbstractDenote the number of vertices of G by |G|. A clique of graph G is a maximal complete subgrap...
AbstractCharacterizations are obtained of the maximal (k + s)-cliques that contain a given maximal k...
AbstractTurán's theorem (Mat. Fiz. Lapok 48 (1941) 436) (or rather its extension by Zykov (Mat. Sbor...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
Let V be an n-dimensional vector space over GF(q). Define a graph Quad as follows: The vertices of Q...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
Maximal cliques in various graphs with combinatorial significance are investigated. The Erdös, Ko, R...
The clique graph H = K (G) of is the intersection graph of the collection of maximal cliques of G. I...
We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of...
AbstractNew upper bounds for the size of minimal maximal k-cliques are obtained. We show (i) m(k)⩽k5...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
AbstractIn this paper we study the maximalt-cliques of theq-analog of the Johnson GraphJq(n, k)with ...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
AbstractDenote the number of vertices of G by |G|. A clique of graph G is a maximal complete subgrap...
AbstractCharacterizations are obtained of the maximal (k + s)-cliques that contain a given maximal k...
AbstractTurán's theorem (Mat. Fiz. Lapok 48 (1941) 436) (or rather its extension by Zykov (Mat. Sbor...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
AbstractThe main aim of the paper is to show that for 2⩽r<s and large enough n, there are graphs of ...
Let V be an n-dimensional vector space over GF(q). Define a graph Quad as follows: The vertices of Q...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
Maximal cliques in various graphs with combinatorial significance are investigated. The Erdös, Ko, R...
The clique graph H = K (G) of is the intersection graph of the collection of maximal cliques of G. I...
We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of...
AbstractNew upper bounds for the size of minimal maximal k-cliques are obtained. We show (i) m(k)⩽k5...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...