@article{MTMT:36404839,
	title = {Local algorithms for the maximum flow and minimum cut in bounded-degree networks},
	url = {https://m2.mtmt.hu/api/publication/36404839},
	author = {Csóka, Endre and Pongrácz, András},
	journal-iso = {J GRAPH THEOR},
	journal = {JOURNAL OF GRAPH THEORY},
	volume = {Accepted: 2025},
	unique-id = {36404839},
	issn = {0364-9024},
	keywords = {Approximation algorithms; Graph algorithms; Randomized Algorithms; Property testing; LOCAL ALGORITHMS; bounded-degree graphs},
	year = {2026},
	eissn = {1097-0118},
	pages = {&}
}

@article{MTMT:37074711,
	title = {Variants of local algorithms on sparse graphs},
	url = {https://m2.mtmt.hu/api/publication/37074711},
	author = {Csóka, Endre},
	journal-iso = {J GRAPH THEOR},
	journal = {JOURNAL OF GRAPH THEORY},
	volume = {accepted: 2025},
	unique-id = {37074711},
	issn = {0364-9024},
	year = {2026},
	eissn = {1097-0118},
	pages = {&}
}

@article{MTMT:36590811,
	title = {Block Partitions in Higher Dimensions},
	url = {https://m2.mtmt.hu/api/publication/36590811},
	author = {Csóka, Endre},
	doi = {10.1007/s00454-025-00732-7},
	journal-iso = {DISCRETE COMPUT GEOM},
	journal = {DISCRETE AND COMPUTATIONAL GEOMETRY},
	volume = {Published: 03 April 2025},
	unique-id = {36590811},
	issn = {0179-5376},
	keywords = {SEQUENCES; Convex body; Discrepancy; Maximal block},
	year = {2025},
	eissn = {1432-0444},
	pages = {&}
}

@CONFERENCE{MTMT:35203325,
	title = {Friendly partitions of regular graphs},
	url = {https://m2.mtmt.hu/api/publication/35203325},
	author = {Nagy, Zoltán Lóránt and Bärnkopf, Pál and Z., Paulovics and Csóka, Endre and Fekete, Panna Tímea and L., Szemerédi.},
	booktitle = {Booklet Summit280},
	unique-id = {35203325},
	abstract = {An internal or friendly partition of a graph is a partition of the vertices into
		two nonempty sets A∪B so that every vertex has at least as many neighbours in its
		own class as in the other one. For regular graphs, this means |N(v)∩A| ≥ deg(v)/2
		for all elements v ∈ A and |N(v) ∩ B| ≥ deg(v)/2 for all elements v ∈ B. An old
		conjecture attributed to DeVos states that for fixed d, such a partition exists for all
		d-regular graphs, apart from finitely many counterexamples. This has been resolved
		for d ∈ {3, 4, 6}. (We remark that this is also closely related to an conjecture of
		Zolt´an F¨uredi, on friendly bisection of the Erd˝os-R´enyi random graph).
		In this talk I will give a survey of related results and highlight the following contributions,
		mostly related to the open d = 5 case:
		Theorem 0.0.8 In each n-vertex 5-regular graph, the intersection of 3-cohesive sets
		with minimum size contains at most n/4 + 1 vertices.
		Here the term k-cohesive was introduced by Ban and Linial [?] for vertex sets
		spanning a graph of minimum degree at least k. Note that for 5-regular graph
		admitting friendly partitions, the intersection of 3-cohesive sets with minimum size
		contains exactly zero vertices. The result relies on the combination of algebraic
		techniques (the Alon-Friedland-Kalai theorem, an application of the Combontorial
		Nullstellensatz) with combinatorial and random techniques.
		40
		Theorem 0.0.9 Asymptotically almost every 5-regular graph has an internal (friendly)
		partition.
		This would follow from a strengthening of the upper bound of the minimum
		bisection width problem for 5-regular random graphs, and refines the random process
		of Diaz, Serna and Wormald and their differential equation method as well.
		Finally we study the problem for the incidence graphs of projective planes, show
		several connections and applications, and point out the possible room for improvement
		in finding partitions where the spanning graphs of the two parts have minimum
		degree greater than the half of the average degree.
		The talk is based on a project joint work with P. Barnkopf, Z. Paulovics, E.
		Csóka, P. Fekete, L. Szemerédi.},
	year = {2024},
	pages = {40},
	orcid-numbers = {Nagy, Zoltán Lóránt/0000-0003-2062-5668}
}

@article{MTMT:33086820,
	title = {Locally common graphs},
	url = {https://m2.mtmt.hu/api/publication/33086820},
	author = {Csóka, Endre and Hubai, Tamás and Lovász, László},
	doi = {10.1002/jgt.22881},
	journal-iso = {J GRAPH THEOR},
	journal = {JOURNAL OF GRAPH THEORY},
	volume = {102},
	unique-id = {33086820},
	issn = {0364-9024},
	abstract = {Goodman proved that the sum of the number of triangles in a graph on  nodes and its complement is at least ; in other words, this sum is minimized, asymptotically, by a random graph with edge density 1/2. Erdős conjectured that a similar inequality will hold for  in place of , but this was disproved by Thomason. But an analogous statement does hold for some other graphs, which are called <jats:italic>common graphs</jats:italic>. Characterization of common graphs seems, however, out of reach. Franek and Rödl proved that  is common in a weaker, local sense. Using the language of graph limits, we study two versions of locally common graphs. We sharpen a result of Jagger, Štovíček and Thomason by showing that no graph containing  can be locally common, but prove that all such graphs are weakly locally common. We also show that not all connected graphs are weakly locally common.},
	year = {2023},
	eissn = {1097-0118},
	pages = {472-483},
	orcid-numbers = {Lovász, László/0000-0001-6596-0465}
}

@article{MTMT:32588884,
	title = {On directed analogues of expander and hyperfinite graph sequences},
	url = {https://m2.mtmt.hu/api/publication/32588884},
	author = {Csóka, Endre and Łukasz, Grabowski},
	doi = {10.1017/S0963548321000225},
	journal-iso = {COMB PROBAB COMPUT},
	journal = {COMBINATORICS PROBABILITY & COMPUTING},
	volume = {31},
	unique-id = {32588884},
	issn = {0963-5483},
	abstract = {We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call 'extender' and 'hypershallow' graph sequences, respectively. Our main result is a probabilistic construction of non-hypershallow graph sequences. © The Author(s), 2021. Published by Cambridge University Press.},
	keywords = {Probability; Computer science; Directed graphs; expander; Directed acyclic graph (DAG); Graph limits; Graph sequences; HYPERFINITE; HYPERFINITE; Extender; Keywords:},
	year = {2022},
	eissn = {1469-2163},
	pages = {184-197}
}

@article{MTMT:33056151,
	title = {Upper bounds for the necklace folding problems},
	url = {https://m2.mtmt.hu/api/publication/33056151},
	author = {Csóka, Endre and Blázsik, Zoltán and Király, Zoltán and Lenger, Dániel Antal},
	doi = {10.1016/j.jctb.2022.05.012},
	journal-iso = {J COMB THEORY B},
	journal = {JOURNAL OF COMBINATORIAL THEORY SERIES B},
	volume = {157},
	unique-id = {33056151},
	issn = {0095-8956},
	abstract = {A necklace can be considered as a cyclic list of n red and n blue beads in an arbitrary order. In the necklace folding problem the goal is to find a large crossing-free matching of pairs of beads of different colors in such a way that there exists a “folding” of the necklace, that is a partition into two contiguous arcs, which splits the beads of any matching edge into different arcs. We give counterexamples for some conjectures about the necklace folding problem, also known as the separated matching problem. The main conjecture (given independently by three sets of authors) states that [Formula presented], where μ is the ratio of the maximum number of matched beads to the total number of beads. We refute this conjecture by giving a construction which proves that μ≤2−2<0.5858≪0.66. Our construction also applies to the homogeneous model when we match beads of the same color. Moreover, we also consider the problem where the two color classes do not necessarily have the same size. © 2022 Elsevier Inc.},
	keywords = {CONSTRUCTION; COUNTEREXAMPLE; Separated matching; Crossing-free matching},
	year = {2022},
	eissn = {1096-0902},
	pages = {123-143},
	orcid-numbers = {Blázsik, Zoltán/0000-0003-1877-9983; Király, Zoltán/0000-0002-9815-5793}
}

@inproceedings{MTMT:32574859,
	title = {Towards solving the 7-in-a-row game},
	url = {https://m2.mtmt.hu/api/publication/32574859},
	author = {Czifra, Domonkos and Csóka, Endre and Zombori, Zsolt and Makay, Géza},
	booktitle = {2021 IEEE Conference on Games (CoG)},
	doi = {10.1109/CoG52621.2021.9618991},
	unique-id = {32574859},
	year = {2021},
	pages = {01-08},
	orcid-numbers = {Makay, Géza/0000-0002-2506-177X}
}

@article{MTMT:31151049,
	title = {Entropy and expansion},
	url = {https://m2.mtmt.hu/api/publication/31151049},
	author = {Csóka, Endre and Harangi, Viktor and Virág, Bálint},
	doi = {10.1214/19-AIHP1044},
	journal-iso = {ANN I H POINCARE-PR},
	journal = {ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES},
	volume = {56},
	unique-id = {31151049},
	issn = {0246-0203},
	year = {2020},
	eissn = {1778-7017},
	pages = {2428-2444}
}

@article{MTMT:3395278,
	title = {Block partitions: an extended view},
	url = {https://m2.mtmt.hu/api/publication/3395278},
	author = {Bárány, Imre and Csóka, Endre and Károlyi, Gyula and Tóth, Géza},
	doi = {10.1007/s10474-018-0802-2},
	journal-iso = {ACTA MATH HUNG},
	journal = {ACTA MATHEMATICA HUNGARICA},
	volume = {155},
	unique-id = {3395278},
	issn = {0236-5294},
	abstract = {Given a sequence , a block B of S is a subsequence . The size b of a block B is the sum of its elements. It is proved in [1] that for each positive integer n, there is a partition of S into n blocks B (1), B (n) with for every i, j. In this paper, we consider a generalization of the problem in higher dimensions.},
	keywords = {transversal; block partition},
	year = {2018},
	eissn = {1588-2632},
	pages = {36-46},
	orcid-numbers = {Károlyi, Gyula/0000-0002-6711-7866}
}