Lajos Soukup

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 9

Top Topics

Monte Carlo Method

Transition Matrix

Top Venues

Ann. Pure Appl. Log.

Publications

Tamás Csernák, Lajos Soukup
Elusive properties of infinite graphs. J. Graph Theory 105 (3) (2024)
Péter L. Erdös, István Miklós, Lajos Soukup
Fully graphic degree sequences and P-stable degree sequences. CoRR (2024)
Tamás Csernák, Lajos Soukup
Minimal vertex covers in infinite hypergraphs. Discret. Math. 346 (4) (2023)
Saharon Shelah, Lajos Soukup
On κ-Homogeneous, but Not κ-Transitive Permutation Groups. J. Symb. Log. 88 (1) (2023)
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 (2022)
Juan Carlos Martínez, Lajos Soukup
A consistency result on long cardinal sequences. Ann. Pure Appl. Log. 172 (10) (2021)
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 (2019)
Dániel T. Soukup, Lajos Soukup
Infinite Combinatorics Plain and Simple. J. Symb. Log. 83 (3) (2018)
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) (2017)
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) (2013)
Dániel T. Soukup, Lajos Soukup
Partitioning bases of topological spaces. Electron. Notes Discret. Math. 43 (2013)
Juan Carlos Martínez, Lajos Soukup
Superatomic Boolean algebras constructed from strongly unbounded functions. Math. Log. Q. 57 (5) (2011)
Lajos Soukup
Elementary submodels in infinite combinatorics. Discret. Math. 311 (15) (2011)
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) (2011)
Péter L. Erdös, Lajos Soukup, Jens Stoye
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance CoRR (2010)
Péter L. Erdös, Lajos Soukup
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. Order 27 (3) (2010)
Juan Carlos Martínez, Lajos Soukup
Cardinal sequences of LCS spaces under GCH. Ann. Pure Appl. Log. 161 (9) (2010)
Péter L. Erdös, Lajos Soukup
Quasi-kernels and quasi-sinks in infinite graphs. Discret. Math. 309 (10) (2009)
Péter L. Erdös, Lajos Soukup
How To Split Antichains In Infinite Posets. Comb. 27 (2) (2007)
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) (2001)
Sakaé Fuchino, Stefan Geschke, Lajos Soukup
On the weak Freese-Nation property of ?(omega). Arch. Math. Log. 40 (6) (2001)
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)
Sakaé Fuchino, Saharon Shelah, Lajos Soukup
Sticks and Clubs. Ann. Pure Appl. Log. 90 (1-3) (1997)
István Juhász, Lajos Soukup, Zoltán Szentmiklóssy
Combinatorial Principles from Adding Cohen Reals. Logic Colloquium (1995)