{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:40Z","timestamp":1725663100148},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540185352"},{"type":"electronic","value":"9783540480082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3540185356_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:37:21Z","timestamp":1330198641000},"page":"51-58","source":"Crossref","is-referenced-by-count":0,"title":["Some combinatorial problems concerning finite languages"],"prefix":"10.1007","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"4_CR1","unstructured":"C. Berge, Graphs and Hypergraphs, North-Holland, 1973."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(81)90044-X","volume":"14","author":"W. Bucher","year":"1981","unstructured":"W. Bucher, K. Culik II, H. Maurer and D. Wotschke, Concise description of finite languages, Theoretical Computer Sci. 14 (1981) 227\u2013246.","journal-title":"Theoretical Computer Sci."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P. Erd\u00f6s","year":"1964","unstructured":"P. Erd\u00f6s, A. Hajnal and J.W. Moon, A problem in graph theory, Amer. Math. Monthly 71(1964) 1107\u20131110.","journal-title":"Amer. Math. Monthly"},{"key":"4_CR4","first-page":"133","volume":"2","author":"T. Gallai","year":"1959","unstructured":"T. Gallai, \u00dcber extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sect. Math. 2 (1959) 133\u2013138.","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sect. Math."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190100209","volume":"10","author":"L. K\u00e1szonyi","year":"1986","unstructured":"L. K\u00e1szonyi and Zs. Tuza, Saturated graphs with minimal number of edges, J. Graph Theory 10 (1986) 203\u2013210.","journal-title":"J. Graph Theory"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02579237","volume":"2","author":"J. Lehel","year":"1982","unstructured":"J. Lehel, Covers in hypergraphs, Combinatorica 2 (1982) 305\u2013309.","journal-title":"Combinatorica"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(82)90040-1","volume":"39","author":"J. Lehel","year":"1982","unstructured":"J. Lehel and Zs. Tuza, Triangle-free partial graphs and edge covering theorems, Discrete Math. 39 (1982) 59\u201365.","journal-title":"Discrete Math."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01428195","volume":"201","author":"W. Mader","year":"1973","unstructured":"W. Mader, 1-Faktoren in Graphen, Math. Ann. 201 (1973) 269\u2013282.","journal-title":"Math. Ann."},{"key":"4_CR9","unstructured":"L.T. Ollman, K2,2-saturated graphs with a minimal number of edges, in: Proc. 3rd South-East Conference on Combinatorics, Graph Theory and Computing, pp. 367\u2013392."},{"key":"4_CR10","unstructured":"A. Salomaa, Formal Languages, Academic Press, 1973."},{"key":"4_CR11","unstructured":"M. Truszczy\u0144ski and Zs. Tuza; Asymptotic results on saturated graphs, submitted."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Zs. Tuza, On the context-free production complexity of finite languages, Discrete Applied Math., to appear.","DOI":"10.1016\/S0166-218X(87)80004-5"},{"key":"4_CR13","first-page":"287","volume":"185","author":"T. Zs","year":"1986","unstructured":"Zs. Tuza, A generalization of saturated graphs for finite languages, MTA SZTAKI Studies 185\/1986, pp. 287\u2013293.","journal-title":"MTA SZTAKI Studies"},{"key":"4_CR14","unstructured":"Zs. Tuza, Intersection properties and extremal problems for set systems, in: Irregularities of Partitions, Proc. Colloq. Math. Soc. J\u00e1nos Bolyai, Fert\u00f6d (Hungary) 1986, to appear."},{"key":"4_CR15","unstructured":"Zs. Tuza, A conjecture on triangles of graphs, in preparation."},{"key":"4_CR16","unstructured":"Zs. Tuza, Perfect triangle families, in preparation."}],"container-title":["Lecture Notes in Computer Science","Trends, Techniques, and Problems in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540185356_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:15:20Z","timestamp":1619558120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540185356_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540185352","9783540480082"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3540185356_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}