Остановите войну!
for scientists:
default search action
Zoltán Füredi
- > Home > Persons > Zoltán Füredi
Publications
- 2015
- [j168]Zoltán Füredi:
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity. J. Comb. Theory, Ser. B 115: 66-71 (2015) - 2014
- [j166]Zoltán Füredi:
Linear trees in uniform hypergraphs. Eur. J. Comb. 35: 264-272 (2014) - 2013
- [p1]Zoltán Füredi:
Intersection Representations of the Complete Bipartite Graph. The Mathematics of Paul Erdős II 2013: 127-134 - 2012
- [j160]Zoltán Füredi:
2-Cancellative Hypergraphs and Codes. Comb. Probab. Comput. 21(1-2): 159-177 (2012) - 2011
- [j154]Zoltán Füredi:
Linear paths and trees in uniform hypergraphs. Electron. Notes Discret. Math. 38: 377-382 (2011) - 2007
- [j135]Zoltán Füredi:
Covering a Triangle with Positive and Negative Homothetic Copies. Discret. Comput. Geom. 38(2): 273-288 (2007) - 2001
- [j110]Zoltán Füredi:
Maximal t-Critical Linear Hypergraphs. Graphs Comb. 17(1): 73-78 (2001) - 1998
- [j99]Zoltán Füredi:
On the Double Competition Number. Discret. Appl. Math. 82(1-3): 251-255 (1998) - 1996
- [j94]Zoltán Füredi:
An Upper Bound on Zarankiewicz' Problem. Comb. Probab. Comput. 5: 29-33 (1996) - [j93]Zoltán Füredi:
On the Number of Edges of Quadrilateral-Free Graphs. J. Comb. Theory, Ser. B 68(1): 1-6 (1996) - [j92]Zoltán Füredi:
On r-Cover-free Families. J. Comb. Theory, Ser. A 73(1): 172-173 (1996) - [j91]Zoltán Füredi:
New Asymptotics for Bipartite Turán Numbers. J. Comb. Theory, Ser. A 75(1): 141-144 (1996) - [j90]Zoltán Füredi:
Scrambling permutations and entropy of hypergraphs. Random Struct. Algorithms 8(2): 97-104 (1996) - 1995
- [j87]Zoltán Füredi:
Cross-Intersecting Families of Finite Sets. J. Comb. Theory, Ser. A 72(2): 332-339 (1995) - 1994
- [j84]Zoltán Füredi:
Random Ramsey graphs for the four-cycle. Discret. Math. 126(1-3): 407-410 (1994) - [j83]Zoltán Füredi:
Intersecting designs from linear programming and graphs of diameter two. Discret. Math. 127(1-3): 187-207 (1994) - 1992
- [j78]Zoltán Füredi:
Indecomposable regular graphs and hypergraphs. Discret. Math. 101(1-3): 59-64 (1992) - [j74]Zoltán Füredi:
The maximum number of edges in a minimal graph of diameter 2. J. Graph Theory 16(1): 81-98 (1992) - 1991
- [j71]Zoltán Füredi:
On a Turán type problem of Erdös. Comb. 11(1): 75-79 (1991) - [j70]Zoltán Füredi:
The Densest Packing of Equal Circles into a Parallel Strip. Discret. Comput. Geom. 6: 95-106 (1991) - [j65]Zoltán Füredi:
Maximal Independent Subsets in Steiner Systems and in Planar Sets. SIAM J. Discret. Math. 4(2): 196-199 (1991) - 1990
- [j62]Zoltán Füredi:
Perfect error-correcting databases. Discret. Appl. Math. 28(2): 171-176 (1990) - [j60]Zoltán Füredi:
Graphs of diameter 3 with the minimum number of edges. Graphs Comb. 6(4): 333-337 (1990) - [j58]Zoltán Füredi:
Covering pairs by q2 + q + 1 sets. J. Comb. Theory, Ser. A 54(2): 248-271 (1990) - [j57]Zoltán Füredi:
The maximum number of unit distances in a convex n-gon. J. Comb. Theory, Ser. A 55(2): 316-320 (1990) - [j56]Zoltán Füredi:
Competition Graphs and Clique Dimensions. Random Struct. Algorithms 1(2): 183-190 (1990) - 1989
- [j54]Zoltán Füredi:
A projective plane is an outstanding 2-cover. Discret. Math. 74(3): 321-324 (1989) - [j53]Zoltán Füredi:
Covering the complete graph by partitions. Discret. Math. 75(1-3): 217-226 (1989) - 1988
- [j45]Zoltán Füredi:
Matchings and covers in hypergraphs. Graphs Comb. 4(1): 115-206 (1988) - 1987
- [j39]Zoltán Füredi:
The maximum number of balancing sets. Graphs Comb. 3(1): 251-254 (1987) - [j36]Zoltán Füredi:
The number of maximal independent sets in connected graphs. J. Graph Theory 11(4): 463-470 (1987) - 1986
- [j33]Zoltán Füredi:
Random Polytopes in the d-Dimensional Cube. Discret. Comput. Geom. 1: 315-319 (1986) - [j30]Zoltán Füredi:
t-expansive andt-wise intersecting hypergraphs. Graphs Comb. 2(1): 67-80 (1986) - [j29]Zoltán Füredi:
The chromatic index of simple hypergraphs. Graphs Comb. 2(1): 89-92 (1986) - 1985
- [j25]Zoltán Füredi:
Set-systems with three intersections. Comb. 5(1): 27-31 (1985) - [j21]Zoltán Füredi:
A Ramsey-Sperner theorem. Graphs Comb. 1(1): 51-56 (1985) - 1984
- [j19]Zoltán Füredi:
Hypergraphs in which all disjoint pairs have distinct unions. Comb. 4(2): 161-168 (1984) - [j15]Zoltán Füredi:
Geometrical Solution of an Intersection Problem for Two Hypergraphs. Eur. J. Comb. 5(2): 133-136 (1984) - 1983
- [j12]Zoltán Füredi:
On finite set-systems whose every intersection is a Kernel of a star. Discret. Math. 47: 129-132 (1983) - [j10]Zoltán Füredi:
Graphs without quadrilaterals. J. Comb. Theory, Ser. B 34(2): 187-190 (1983) - 1982
- [j9]Zoltán Füredi:
Set-systems with prescribed cardinalities for pairwise intersections. Discret. Math. 40(1): 53-67 (1982) - [j8]Zoltán Füredi:
An Intersection Problem Whose Extremum Is the Finite Projective Space. J. Comb. Theory, Ser. A 32(1): 66-72 (1982) - 1981
- [j6]Zoltán Füredi:
Maximum degree and fractional matchings in uniform hypergraphs. Comb. 1(2): 155-162 (1981) - 1980
- [j2]Zoltán Füredi:
On Maximal Intersecting Families of Finite Sets. J. Comb. Theory, Ser. A 28(3): 282-289 (1980)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint