default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLajos Soukup
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Tamás Csernák, Lajos Soukup
:
Elusive properties of infinite graphs. J. Graph Theory 105(3): 427-450 (2024)- [i3]Péter L. Erdös, István Miklós, Lajos Soukup:
Fully graphic degree sequences and P-stable degree sequences. CoRR abs/2405.12013 (2024) - 2023
- [j18]Tamás Csernák, Lajos Soukup:
Minimal vertex covers in infinite hypergraphs. Discret. Math. 346(4): 113280 (2023) - [j17]Saharon Shelah, Lajos Soukup:
On κ-Homogeneous, but Not κ-Transitive Permutation Groups. J. Symb. Log. 88(1): 363-380 (2023) - 2022
- [j16]Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup:
The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. 99: 103421 (2022) - 2021
- [j15]Juan Carlos Martínez, Lajos Soukup:
A consistency result on long cardinal sequences. Ann. Pure Appl. Log. 172(10): 103017 (2021)
2010 – 2019
- 2019
- [i2]Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup:
The mixing time of the swap (switch) Markov chains: a unified approach. CoRR abs/1903.06600 (2019) - 2018
- [j14]Dániel T. Soukup, Lajos Soukup:
Infinite Combinatorics Plain and Simple. J. Symb. Log. 83(3): 1247-1281 (2018) - 2017
- [j13]Márton Elekes, Dániel T. Soukup, Lajos Soukup, Zoltán Szentmiklóssy:
Decompositions of edge-colored infinite complete graphs into monochromatic paths. Discret. Math. 340(8): 2053-2069 (2017) - 2013
- [j12]István Miklós, Péter L. Erdös, Lajos Soukup:
Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. Electron. J. Comb. 20(1): 16 (2013) - [j11]Dániel T. Soukup, Lajos Soukup:
Partitioning bases of topological spaces. Electron. Notes Discret. Math. 43: 79-81 (2013) - 2011
- [j10]Péter L. Erdös, Lajos Soukup, Jens Stoye:
Balanced vertices in trees and a simpler algorithm to compute the genomic distance. Appl. Math. Lett. 24(1): 82-86 (2011) - [j9]Lajos Soukup:
Elementary submodels in infinite combinatorics. Discret. Math. 311(15): 1585-1598 (2011) - [j8]Juan Carlos Martínez, Lajos Soukup:
Superatomic Boolean algebras constructed from strongly unbounded functions. Math. Log. Q. 57(5): 456-469 (2011) - 2010
- [j7]Juan Carlos Martínez, Lajos Soukup:
Cardinal sequences of LCS spaces under GCH. Ann. Pure Appl. Log. 161(9): 1180-1193 (2010) - [j6]Péter L. Erdös, Lajos Soukup:
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. Order 27(3): 317-325 (2010) - [i1]Péter L. Erdös, Lajos Soukup, Jens Stoye:
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. CoRR abs/1004.2735 (2010)
2000 – 2009
- 2009
- [j5]Péter L. Erdös, Lajos Soukup:
Quasi-kernels and quasi-sinks in infinite graphs. Discret. Math. 309(10): 3040-3048 (2009) - 2007
- [j4]Péter L. Erdös, Lajos Soukup:
How To Split Antichains In Infinite Posets. Comb. 27(2): 147-161 (2007) - 2001
- [j3]Sakaé Fuchino, Stefan Geschke, Lajos Soukup:
On the weak Freese-Nation property of ?(omega). Arch. Math. Log. 40(6): 425-435 (2001) - [j2]Sakaé Fuchino, Stefan Geschke, Saharon Shelah, Lajos Soukup:
On the weak Freese-Nation property of complete Boolean algebras. Ann. Pure Appl. Log. 110(1-3): 89-105 (2001)
1990 – 1999
- 1999
- [c2]István Juhász, Lajos Soukup, Zoltán Szentmiklóssy:
A consistent example of a hereditarily c-Lindelof first countable space of size > c. Set Theory: The Hajnal Conference 1999: 95-98 - 1997
- [j1]Sakaé Fuchino, Saharon Shelah, Lajos Soukup:
Sticks and Clubs. Ann. Pure Appl. Log. 90(1-3): 57-77 (1997) - 1995
- [c1]István Juhász, Lajos Soukup, Zoltán Szentmiklóssy:
Combinatorial Principles from Adding Cohen Reals. Logic Colloquium 1995: 79-103
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-06-25 21:53 CEST 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:
