REAL

Items where Author is "Soukup, Lajos"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 28.

Erdős, Péter and Miklós, István and Soukup, Lajos (2025) Fully graphic degree sequences and P-stable degree sequences. ADVANCES IN APPLIED MATHEMATICS, 163 (Part A). No. 102805. ISSN 0196-8858

Csernák, Tamás and Soukup, Lajos (2023) Elusive properties of infinite graphs. DISCRETE MATHEMATICS. ISSN 0012-365X

Csernák, Tamás and Soukup, Lajos (2023) Minimal vertex covers in infinite hypergraphs. DISCRETE MATHEMATICS, 346 (4). ISSN 0012-365X

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2023) On a problem of Angelo Bella. TOPOLOGY AND ITS APPLICATIONS, 340. ISSN 0166-8641

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2023) On resolvability of products. FUNDAMENTA MATHEMATICAE, 260. pp. 281-295. ISSN 0016-2736

Shelah, Saharon and Soukup, Lajos (2023) On κ-Homogeneous, but not κ-Transitive Permutation Groups. JOURNAL OF SYMBOLIC LOGIC, 88 (1). pp. 363-380. ISSN 0022-4812

Juhász, István and van Mill, Jan and Soukup, Lajos and Szentmiklóssy, Zoltán (2023) The double density spectrum of a topological space. ISRAEL JOURNAL OF MATHEMATICS, 255. pp. 383-400. ISSN 0021-2172

Erdős, Péter and Greenhill, C. and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel and Soukup, Lajos (2022) The mixing time of switch Markov chains: A unified approach. EUROPEAN JOURNAL OF COMBINATORICS, 99. No.-103421. ISSN 0195-6698

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2018) First countable almost discretely Lindelöf T3 spaces have cardinality at most continuum. TOPOLOGY AND ITS APPLICATIONS. ISSN 0166-8641

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2018) First countable almost discretely Lindelöf T3 spaces have cardinality at most continuum. TOPOLOGY AND ITS APPLICATIONS, 241. pp. 145-149. ISSN 0166-8641

Soukup, Dániel Tamás and Soukup, Lajos (2018) Infinite Combinatorics Plain and Simple. JOURNAL OF SYMBOLIC LOGIC, 83 (3). pp. 1247-1281. ISSN 0022-4812

Elekes, Márton and Soukup, Dániel Tamás and Soukup, Lajos and Szentmiklóssy, Zoltán (2017) Decompositions of edge-colored infinite complete graphs into monochromatic paths. DISCRETE MATHEMATICS, 340 (8). pp. 2053-2069. ISSN 0012-365X

Soukup, Lajos and Stanley, Adrienne (2017) Resolvability in c.c.c. generic extensions. COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 58 (4). pp. 519-529. ISSN 0010-2628

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2016) Anti-Urysohn spaces. TOPOLOGY AND ITS APPLICATIONS, 213. pp. 8-23. ISSN 0166-8641

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2016) Pinning down versus density. ISRAEL JOURNAL OF MATHEMATICS, 215 (2). pp. 583-605. ISSN 0021-2172

Erdős, Péter and Kiss, Sándor and Miklós, István and Soukup, Lajos (2015) Approximate Counting of Graphical Realizations. PLOS ONE, 10 (7). e0131300. ISSN 1932-6203

Juhász, István and Soukup, Lajos and Szentmiklóssy, Zoltán (2015) Regular spaces of small extent are omega-resolvable. FUNDAMENTA MATHEMATICAE, 228. pp. 27-46. ISSN 0016-2736

Soukup, Dániel Tamás and Soukup, Lajos (2014) Partitioning bases of topological spaces. COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 55 (4). pp. 537-566. ISSN 0010-2628

Dániel, T. Soukup and Soukup, Lajos and Santi, Spadaro (2013) Comparing weak versions of separability. TOPOLOGY AND ITS APPLICATIONS, 160 (18). pp. 2538-2566. ISSN 0166-8641

Miklós, István and Erdős, Péter and Soukup, Lajos (2013) Towards random uniform sampling of bipartite graphs with given degree sequence. ELECTRONIC JOURNAL OF COMBINATORICS, 20 (1). ISSN 1077-8926

Hajnal, András and Erdős, Péter and Farkas, Barnabás and Juhász, István and Patkós, Balázs and Sági, Gábor and Soukup, Lajos and Szentmiklóssy, Zoltán (2012) Halmazelmélet; Partíció kalkulus, Végtelen gráfok elmélete = Set Theory; Partition Calculus , Theory of Infinite Graphs. Project Report. OTKA.

Erdős, Péter and Stoye, J. and Soukup, Lajos (2011) Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. APPLIED MATHEMATICS LETTERS, 24. pp. 82-86. ISSN 0893-9659

Juhász, István and Elekes, Márton and Gerlits, János and Hajnal, András and Mátrai, Tamás and Nagy, Zsigmond and Soukup, Lajos and Szentmiklóssy, Zoltán (2011) Halmazelméleti topológia = Set-theoretic topology. Project Report. OTKA.

Erdős, Péter and Soukup, Lajos (2010) No Finite–Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 27 (3). pp. 317-325. ISSN 0167-8094

Erdős, Péter and Soukup, Lajos (2009) Quasi-kernels and quasi-sinks in infinite graphs. DISCRETE MATHEMATICS, 309 (10). pp. 3040-3048. ISSN 0012-365X

Duffus, D. and Erdős, Péter and Nešetril, J. and Soukup, Lajos (2007) Antichains in the homomorphism order of graphs. COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 48 (4). pp. 571-583. ISSN 0010-2628

Juhász, István and Elekes, Márton and Gerlits, János and Nagy, Zsigmond and Soukup, Lajos and Szentmiklóssy, Zoltán (2007) Halmazelmélet és halmazelméleti topológia = Set-theory and set-theoretical topology. Project Report. OTKA.

Erdős, Péter and Soukup, Lajos (2007) How to split antichains in infinite posets. COMBINATORICA, 27 (2). pp. 147-161. ISSN 0209-9683

This list was generated on Thu Jul 10 04:55:10 2025 CEST.