Abstract
Some combinatorial functions are introduced for finite languages. Various conjectures and problems are raised.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphs and Hypergraphs, North-Holland, 1973.
W. Bucher, K. Culik II, H. Maurer and D. Wotschke, Concise description of finite languages, Theoretical Computer Sci. 14 (1981) 227–246.
P. Erdös, A. Hajnal and J.W. Moon, A problem in graph theory, Amer. Math. Monthly 71(1964) 1107–1110.
T. Gallai, Über extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 2 (1959) 133–138.
L. Kászonyi and Zs. Tuza, Saturated graphs with minimal number of edges, J. Graph Theory 10 (1986) 203–210.
J. Lehel, Covers in hypergraphs, Combinatorica 2 (1982) 305–309.
J. Lehel and Zs. Tuza, Triangle-free partial graphs and edge covering theorems, Discrete Math. 39 (1982) 59–65.
W. Mader, 1-Faktoren in Graphen, Math. Ann. 201 (1973) 269–282.
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–392.
A. Salomaa, Formal Languages, Academic Press, 1973.
M. Truszczyński and Zs. Tuza; Asymptotic results on saturated graphs, submitted.
Zs. Tuza, On the context-free production complexity of finite languages, Discrete Applied Math., to appear.
Zs. Tuza, A generalization of saturated graphs for finite languages, MTA SZTAKI Studies 185/1986, pp. 287–293.
Zs. Tuza, Intersection properties and extremal problems for set systems, in: Irregularities of Partitions, Proc. Colloq. Math. Soc. János Bolyai, Fertöd (Hungary) 1986, to appear.
Zs. Tuza, A conjecture on triangles of graphs, in preparation.
Zs. Tuza, Perfect triangle families, in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tuza, Z. (1987). Some combinatorial problems concerning finite languages. In: Kelemenová, A., Kelemen, J. (eds) Trends, Techniques, and Problems in Theoretical Computer Science. IMYCS 1986. Lecture Notes in Computer Science, vol 281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540185356_30
Download citation
DOI: https://doi.org/10.1007/3540185356_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18535-2
Online ISBN: 978-3-540-48008-2
eBook Packages: Springer Book Archive