Lajos Soukup

According to our database, Lajos Soukup authored at least 23 papers between 1995 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Fully graphic degree sequences and P-stable degree sequences.

Péter L. Erdös, István Miklós, Lajos Soukup

Adv. Appl. Math., 2025

2024

Elusive properties of infinite graphs.

Tamás Csernák, Lajos Soukup

J. Graph Theory, March, 2024

2023

Minimal vertex covers in infinite hypergraphs.

Tamás Csernák, Lajos Soukup

Discret. Math., April, 2023

On κ-Homogeneous, but Not κ-Transitive Permutation Groups.

Saharon Shelah, Lajos Soukup

J. Symb. Log., March, 2023

2022

The mixing time of switch Markov chains: A unified approach.

Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup

Eur. J. Comb., 2022

2021

A consistency result on long cardinal sequences.

Juan Carlos Martínez, Lajos Soukup

Ann. Pure Appl. Log., 2021

2019

The mixing time of the swap (switch) Markov chains: a unified approach.

Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup

CoRR, 2019

2018

Infinite Combinatorics Plain and Simple.

Dániel T. Soukup, Lajos Soukup

J. Symb. Log., 2018

2017

Decompositions of edge-colored infinite complete graphs into monochromatic paths.

Márton Elekes, Dániel T. Soukup, Lajos Soukup, Zoltán Szentmiklóssy

Discret. Math., 2017

2013

Partitioning bases of topological spaces.

Dániel T. Soukup, Lajos Soukup

Electron. Notes Discret. Math., 2013

Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence.

István Miklós, Péter L. Erdös, Lajos Soukup

Electron. J. Comb., 2013

2011

Superatomic Boolean algebras constructed from strongly unbounded functions.

Juan Carlos Martínez, Lajos Soukup

Math. Log. Q., 2011

Elementary submodels in infinite combinatorics.

Lajos Soukup

Discret. Math., 2011

Balanced vertices in trees and a simpler algorithm to compute the genomic distance.

Péter L. Erdös, Lajos Soukup, Jens Stoye

Appl. Math. Lett., 2011

2010

No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs.

Péter L. Erdös, Lajos Soukup

Order, 2010

Cardinal sequences of LCS spaces under GCH.

Juan Carlos Martínez, Lajos Soukup

Ann. Pure Appl. Log., 2010

2009

Quasi-kernels and quasi-sinks in infinite graphs.

Péter L. Erdös, Lajos Soukup

Discret. Math., 2009

2007

How To Split Antichains In Infinite Posets.

Péter L. Erdös, Lajos Soukup

Comb., 2007

2001

On the weak Freese-Nation property of complete Boolean algebras.

Sakaé Fuchino, Stefan Geschke, Saharon Shelah, Lajos Soukup

Ann. Pure Appl. Log., 2001

On the weak Freese-Nation property of ?(omega).

Sakaé Fuchino, Stefan Geschke, Lajos Soukup

Arch. Math. Log., 2001

1999

A consistent example of a hereditarily c-Lindelof first countable space of size > c.

István Juhász, Lajos Soukup, Zoltán Szentmiklóssy

Proceedings of the Set Theory: The Hajnal Conference, 1999

1997

Sticks and Clubs.

Sakaé Fuchino, Saharon Shelah, Lajos Soukup

Ann. Pure Appl. Log., 1997

1995

Combinatorial Principles from Adding Cohen Reals.

István Juhász, Lajos Soukup, Zoltán Szentmiklóssy

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995