default search action
Zoltán Lóránt Nagy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j31]Benedek Kovács, Zoltán Lóránt Nagy
:
Avoiding intersections of given size in finite affine spaces AG(n,2). J. Comb. Theory, Ser. A 209: 105959 (2025) - 2024
- [j30]János Barát, Andrzej Grzesik, Attila Jung
The double Hall property and cycle covers in bipartite graphs. Discret. Math. 347(9): 114079 (2024) - [j29]Pál Bärnkopf, Zoltán Lóránt Nagy
A Note on Internal Partitions: The 5-Regular Case and Beyond. Graphs Comb. 40(2): 36 (2024) - 2023
- [j28]Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe
The extensible No-Three-In-Line problem. Eur. J. Comb. 114: 103796 (2023) - 2022
- [j27]Dávid Matolcsi, Zoltán Lóránt Nagy
Generalised outerplanar Turán numbers and maximum number of k-vertex subtrees. Discret. Appl. Math. 307: 115-124 (2022) - [j26]Oliver Janzer, Zoltán Lóránt Nagy
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz. Des. Codes Cryptogr. 90(9): 1991-2001 (2022) - [j25]Dániel Gerbner, Zoltán Lóránt Nagy
Unified approach to the generalized Turán problem and supersaturation. Discret. Math. 345(3): 112743 (2022) - [j24]András Imolay
Multicolor Turán numbers. Discret. Math. 345(9): 112976 (2022) - [j23]Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy:
The Turán number of blow-ups of trees. J. Comb. Theory B 156: 299-309 (2022) - [j22]Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy:
On the Turán Number of the Blow-Up of the Hexagon. SIAM J. Discret. Math. 36(2): 1187-1199 (2022) - [j21]Tamás Héger
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces. IEEE Trans. Inf. Theory 68(2): 881-890 (2022) - 2021
- [j20]Zoltán L. Blázsik
On the balanced upper chromatic number of finite projective planes. Discret. Math. 344(3): 112266 (2021) - [i1]Tamás Héger, Zoltán Lóránt Nagy:
Short minimal codes and covering codes via strong blocking sets in projective spaces. CoRR abs/2103.07393 (2021) - 2020
- [j19]Gábor Damásdi
Triangle areas in line arrangements. Discret. Math. 343(12): 112105 (2020) - [j18]Zoltán L. Blázsik, Zoltán Lóránt Nagy
Spreading linear triple systems and expander triple systems. Eur. J. Comb. 89: 103155 (2020)
2010 – 2019
- 2019
- [j17]János Barát, Zoltán Lóránt Nagy:
Transversals in generalized Latin squares. Ars Math. Contemp. 16(1): 39-47 (2019) - [j16]Zoltán Lóránt Nagy
Supersaturation of C4: From Zarankiewicz towards Erdős-Simonovits-Sidorenko. Eur. J. Comb. 75: 19-31 (2019) - 2018
- [j15]Zoltán Lóránt Nagy
Saturating sets in projective planes and hypergraph covers. Discret. Math. 341(4): 1078-1083 (2018) - [j14]Zoltán Lóránt Nagy:
Coupon-Coloring and Total Domination in Hamiltonian Planar Triangulations. Graphs Comb. 34(6): 1385-1394 (2018) - 2017
- [j13]Zoltán Blázsik, Zoltán Lóránt Nagy:
Partition dimension of projective planes. Eur. J. Comb. 65: 37-44 (2017) - [j12]Zoltán Lóránt Nagy:
Generalizing Erdős, Moon and Moser's result - The number of k-dominating independent sets. Electron. Notes Discret. Math. 61: 909-915 (2017) - [j11]Zoltán Lóránt Nagy
On the Number of k-Dominating Independent Sets. J. Graph Theory 84(4): 566-580 (2017) - 2016
- [j10]Zoltán Lóránt Nagy:
Density version of the Ramsey problem and the directed Ramsey problem. Australas. J Comb. 66: 240-255 (2016) - 2015
- [j9]Zoltán Lóránt Nagy, Balázs Patkós:
On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method. Electron. J. Comb. 22(1): 1 (2015) - [j8]Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy
Identifying codes and searching with balls in graphs. Discret. Appl. Math. 193: 39-47 (2015) - [j7]Andrzej Grzesik
Avoider-Enforcer star games. Discret. Math. Theor. Comput. Sci. 17(1): 145-160 (2015) - 2014
- [j6]Zoltán Lóránt Nagy
Permutations over cyclic groups. Eur. J. Comb. 41: 68-78 (2014) - 2013
- [j5]Zoltán Lóránt Nagy
On the ratio of maximum and minimum degree in maximal intersecting families. Discret. Math. 313(2): 207-211 (2013) - 2012
- [j4]Péter Csikvári, Zoltán Lóránt Nagy
The Density Turán Problem. Comb. Probab. Comput. 21(4): 531-553 (2012) - [j3]Zoltán Király
On Families of Weakly Cross-intersecting Set-pairs. Fundam. Informaticae 117(1-4): 189-198 (2012) - 2011
- [j2]Zoltán Lóránt Nagy:
A Multipartite Version of the Turan Problem - Density Conditions and Eigenvalues. Electron. J. Comb. 18(1) (2011) - 2010
- [j1]András Gács, Tamás Héger
Permutations, hyperplanes and polynomials over finite fields. Finite Fields Their Appl. 16(5): 301-314 (2010)
Coauthor Index
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-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: