Further Results on Existentially Closed Graphs Arising from Block Designs
Sign Up to like & getrecommendations! Published in 2019 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-019-02036-z
Abstract: A graph is n-existentially closed (n-e.c.) if for any disjoint subsets A, B of vertices with $$\left| {A \cup B} \right| =n$$A∪B=n, there is a vertex $$z \notin A \cup B$$z∉A∪B adjacent to every vertex… read more here.
Keywords: existentially closed; graphs; block; intersection graphs ... See more keywords
Vertex disjoint cycles in intersection graphs of bases of matroids
Sign Up to like & getrecommendations! Published in 2017 at "Wuhan University Journal of Natural Sciences"
DOI: 10.1007/s11859-017-1273-y
Abstract: The intersection graph of bases of a matroid M=(E, B) is a graph G=GI (M) with vertex set V(G) and edge set E(G) such that V(G)=B(M) and E(G)={BB′: |B ∩ B′|≠0, B, B′∈ B(M), where… read more here.
Keywords: intersection; cycles intersection; graphs bases; disjoint cycles ... See more keywords