{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:34Z","timestamp":1720640854991},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80117-9","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"31-34","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["On 2-e.c. graphs, tournaments, and hypergraphs"],"prefix":"10.1016","volume":"5","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[]},{"given":"Kathie","family":"Cameron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80117-9_BIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/jgt.3190150404","article-title":"Characterization of a class of triangle-free graphs with a certain adjacency property","volume":"15","author":"Alspach","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(05)80117-9_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/net.3230230404","article-title":"On the adjacency properties of Paley graphs","volume":"23","author":"Ananchuen","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S1571-0653(05)80117-9_BIB3","first-page":"89","article-title":"On tournaments with a prescribed property","volume":"36","author":"Ananchuen","year":"1993","journal-title":"Ars Combin."},{"key":"10.1016\/S1571-0653(05)80117-9_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190030305","article-title":"Properties of almost all graphs and complexes","volume":"3","author":"Blass","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(05)80117-9_BIB5","unstructured":"A. Bonato, Constrained classes closed under unions and n-e.c. structures, to appear in Ars Combin."},{"key":"10.1016\/S1571-0653(05)80117-9_BIB6","unstructured":"A. Bonato, K. Cameron, On an adjacency property of almost all graphs, to appear in Discrete Math."},{"key":"10.1016\/S1571-0653(05)80117-9_BIB7","unstructured":"and [8]. For a fixed integer n \u2a7e 1, a graph G is called n-existentially closed or n-e.c. if for for every n-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to every vertex in T and to no vertex in S \\ T. In each of the classes described above, we determine the possible orders of the 2-e.c. members of the class, and give explicit examples for all such orders. Some results on adjacency properties in the class of k-uniform hypergraphs are discussed."},{"key":"10.1016\/S1571-0653(05)80117-9_BIB8","first-page":"287","article-title":"A property of random graphs","volume":"19","author":"L. Caccetta","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/S1571-0653(05)80117-9_BIB9","first-page":"333","article-title":"The random graph","volume":"14","author":"Cameron","year":"1997"},{"key":"10.1016\/S1571-0653(05)80117-9_BIB10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S1571-0653(05)80117-9_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","article-title":"A constructive solution to a tournament problem","volume":"14","author":"Graham","year":"1971","journal-title":"Canad. Math. Bull."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801179?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801179?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:57:43Z","timestamp":1548532663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":11,"alternative-id":["S1571065305801179"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80117-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}