Journal Article10.1007/BF01904851
On generalized graphs
421
About: This article is published in Acta Mathematica Hungarica. The article was published on 01 Sep 1965.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Parameterized Algorithms
Marek Cygan,Fedor V. Fomin,Lukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh +7 more
- 27 Jul 2015
TL;DR: This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques.
2.1K
Finding and counting given length cycles
TL;DR: An assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs improve upon various previously known results.
Families of finite sets in which no set is covered by the union ofr others
TL;DR: In this paper, it was shown that the maximum number of k-subsets of ann-set satisfying the condition in the title satisfying the Steiner system is f(n, r(t−1)+1,n−d.
537
Extremal problems in graph theory
TL;DR: The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.
327
References
An extremal problem in graph theory
TL;DR: In this paper, the smallest integer such that there is a G (n;f0(n, k)) in which for every set of k vertices there is vertex joined to each of these.
A Problem in Graph Theory
TL;DR: In this article, it is shown that with the addition of any new edge a compIete k-graph is formed, where each edge joins a vertex to itself and at most one edge joins any two vertices.
325