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