Lajos Soukup

26 papers Journal 24Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Fully graphic degree sequences and P-stable degree sequences.
Adv. Appl. Math.
Péter L. Erdös, István Miklós, Lajos Soukup
2025 J jnl
Infinite combinatorics revisited in the absence of Axiom of choice.
Arch. Math. Log.
Tamás Csernák, Lajos Soukup
2024 J jnl
Elusive properties of infinite graphs.
J. Graph Theory
Tamás Csernák, Lajos Soukup
2024 J jnl
Fully graphic degree sequences and P-stable degree sequences.
CoRR
Péter L. Erdös, István Miklós, Lajos Soukup
2023 J jnl
Minimal vertex covers in infinite hypergraphs.
Discret. Math.
Tamás Csernák, Lajos Soukup
2023 J jnl
On κ-Homogeneous, but Not κ-Transitive Permutation Groups.
J. Symb. Log.
Saharon Shelah, Lajos Soukup
2022 J jnl
The mixing time of switch Markov chains: A unified approach.
Eur. J. Comb.
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2021 J jnl
A consistency result on long cardinal sequences.
Ann. Pure Appl. Log.
Juan Carlos Martínez, Lajos Soukup
2019 J jnl
The mixing time of the swap (switch) Markov chains: a unified approach.
CoRR
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2018 J jnl
Infinite Combinatorics Plain and Simple.
J. Symb. Log.
Dániel T. Soukup, Lajos Soukup
2017 J jnl
Decompositions of edge-colored infinite complete graphs into monochromatic paths.
Discret. Math.
Márton Elekes, Dániel T. Soukup, Lajos Soukup, Zoltán Szentmiklóssy
2013 J jnl
Partitioning bases of topological spaces.
Electron. Notes Discret. Math.
Dániel T. Soukup, Lajos Soukup
2013 J jnl
Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence.
Electron. J. Comb.
István Miklós, Péter L. Erdös, Lajos Soukup
2011 J jnl
Balanced vertices in trees and a simpler algorithm to compute the genomic distance.
Appl. Math. Lett.
Péter L. Erdös, Lajos Soukup, Jens Stoye
2011 J jnl
Elementary submodels in infinite combinatorics.
Discret. Math.
Lajos Soukup
2011 J jnl
Superatomic Boolean algebras constructed from strongly unbounded functions.
Math. Log. Q.
Juan Carlos Martínez, Lajos Soukup
2010 J jnl
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
CoRR
Péter L. Erdös, Lajos Soukup, Jens Stoye
2010 J jnl
Cardinal sequences of LCS spaces under GCH.
Ann. Pure Appl. Log.
Juan Carlos Martínez, Lajos Soukup
2010 J jnl
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs.
Order
Péter L. Erdös, Lajos Soukup
2009 J jnl
Quasi-kernels and quasi-sinks in infinite graphs.
Discret. Math.
Péter L. Erdös, Lajos Soukup
2007 J jnl
How To Split Antichains In Infinite Posets.
Comb.
Péter L. Erdös, Lajos Soukup
2001 J jnl
On the weak Freese-Nation property of ?(omega).
Arch. Math. Log.
Sakaé Fuchino, Stefan Geschke, Lajos Soukup
2001 J jnl
On the weak Freese-Nation property of complete Boolean algebras.
Ann. Pure Appl. Log.
Sakaé Fuchino, Stefan Geschke, Saharon Shelah, Lajos Soukup
1999 — conf
A consistent example of a hereditarily c-Lindelof first countable space of size > c.
Set Theory: The Hajnal Conference
István Juhász, Lajos Soukup, Zoltán Szentmiklóssy
1997 J jnl
Sticks and Clubs.
Ann. Pure Appl. Log.
Sakaé Fuchino, Saharon Shelah, Lajos Soukup
1995 — conf
Combinatorial Principles from Adding Cohen Reals.
Logic Colloquium
István Juhász, Lajos Soukup, Zoltán Szentmiklóssy