@article{MTMT:34779676,
	title = {Comparison and Equality of Bajraktarevic-type ψ-estimators},
	url = {https://m2.mtmt.hu/api/publication/34779676},
	author = {Barczy, Mátyás and Páles, Zsolt},
	doi = {10.57805/revstat.vi.703},
	journal-iso = {REVSTAT-STAT J},
	journal = {REVSTAT-STATISTICAL JOURNAL},
	volume = {24},
	unique-id = {34779676},
	issn = {1645-6726},
	abstract = {We solve the comparison problem for Bajraktarević-type ψ-estimators introduced by Barczy and Páles in 2022. Namely, we derive several necessary and sufficient conditions under which a Bajraktarević-type ψ-estimator is less than or equal to another Bajraktarević-type ψ-estimator for any sample. We also solve the corresponding equality problem. As an important particular case, we obtain the solutions of the two problems in question for quasi-arithmetic-type ψ-estimators.},
	keywords = {[psi]-estimator; Z-estimator; comparison of estimators; quasi-arithmetic-type estimator; Bajraktarevic-type ψ-estimators},
	year = {2026},
	eissn = {2183-0371},
	pages = {71-90},
	orcid-numbers = {Barczy, Mátyás/0000-0003-3119-7953; Páles, Zsolt/0000-0003-2382-6035}
}

@article{MTMT:35056199,
	title = {The connection between the chromatic numbers of a hypergraph and its 1-intersection graph},
	url = {https://m2.mtmt.hu/api/publication/35056199},
	author = {Blázsik, Zoltán and Nathan, W. Lemons},
	doi = {10.1016/j.disc.2025.114810},
	journal-iso = {DISCRETE MATH},
	journal = {DISCRETE MATHEMATICS},
	volume = {349},
	unique-id = {35056199},
	issn = {0012-365X},
	abstract = {A well known problem from an excellent book of Lovász states that any hypergraph with the property that no pair of hyperedges intersect in exactly one vertex can be properly 2-colored. Motivated by this as well as recent works of Keszegh and of Gyárfás et al we study the 1-intersection graph of a hypergraph. The 1-intersection graph encodes those pairs of hyperedges in a hypergraph that intersect in exactly one vertex. We prove for k∈{2,4} that all hypergraphs whose 1-intersection graph is k-partite can be properly k-colored.},
	year = {2026},
	eissn = {1872-681X},
	orcid-numbers = {Blázsik, Zoltán/0000-0003-1877-9983}
}

@article{MTMT:35579584,
	title = {A Central Limit Theorem for Random Disc-Polygons in Smooth Convex Discs},
	url = {https://m2.mtmt.hu/api/publication/35579584},
	author = {Fodor, Ferenc and Papvári, Dániel István},
	doi = {10.1007/s00454-024-00701-6},
	journal-iso = {DISCRETE COMPUT GEOM},
	journal = {DISCRETE AND COMPUTATIONAL GEOMETRY},
	volume = {75},
	unique-id = {35579584},
	issn = {0179-5376},
	abstract = {In this paper we prove a quantitative central limit theorem for the area of uniform random disc-polygons in smooth convex discs whose boundary is C^2_+ C + 2 . We use Stein’s method and the asymptotic lower bound for the variance of the area proved by Fodor, Grünfelder and Vígh (Doc Math 27: 1015-1029, 2022).},
	year = {2026},
	eissn = {1432-0444},
	pages = {93-110},
	orcid-numbers = {Fodor, Ferenc/0000-0001-9747-1981; Papvári, Dániel István/0009-0008-4813-2906}
}

@article{MTMT:35635558,
	title = {Stable Periodic Orbits for Delay Differential Equations with Unimodal Feedback},
	url = {https://m2.mtmt.hu/api/publication/35635558},
	author = {Benedek, Gábor István and Krisztin, Tibor and Szczelina, Robert},
	doi = {10.1007/s10884-024-10399-y},
	journal-iso = {J DYN DIFFER EQU},
	journal = {JOURNAL OF DYNAMICS AND DIFFERENTIAL EQUATIONS},
	volume = {38},
	unique-id = {35635558},
	issn = {1040-7294},
	abstract = {We consider delay differential equations of the form y^{\prime }(t)=-ay(t)+bf(y(t-1)) y ′ ( t ) = - a y ( t ) + b f ( y ( t - 1 ) ) with positive parameters a ,  b and a unimodal f:[0,\infty )\rightarrow [0,1] f : [ 0 , ∞ ) → [ 0 , 1 ] . It is assumed that the nonlinear f is close to a function g:[0,\infty )\rightarrow [0,1] g : [ 0 , ∞ ) → [ 0 , 1 ] with g(\xi )=0 g ( ξ ) = 0 for all \xi >1 ξ > 1 . The fact g(\xi )=0 g ( ξ ) = 0 for all \xi >1 ξ > 1 allows to construct stable periodic orbits for the equation x^{\prime }(t)=-cx(t)+dg(x(t-1)) x ′ ( t ) = - c x ( t ) + d g ( x ( t - 1 ) ) with some parameters d>c>0 d > c > 0 . Then it is shown that the equation y^{\prime }(t)=-ay(t)+bf(y(t-1)) y ′ ( t ) = - a y ( t ) + b f ( y ( t - 1 ) ) also has a stable periodic orbit provided a ,  b ,  f are sufficiently close to c ,  d ,  g in a certain sense. The examples include f(\xi )=\frac{\xi ^k}{1+\xi ^n} f ( ξ ) = ξ k 1 + ξ n for parameters k>0 k > 0 and n>0 n > 0 together with the discontinuous g(\xi )=\xi ^k g ( ξ ) = ξ k for \xi \in [0,1) ξ ∈ [ 0 , 1 ) , and g(\xi )=0 g ( ξ ) = 0 for \xi >1 ξ > 1 . The case k=1 k = 1 is the famous Mackey–Glass equation, the case k>1 k > 1 appears in population models with Allee effect, and the case k\in (0,1) k ∈ ( 0 , 1 ) arises in some economic growth models. The obtained stable periodic orbits may have complicated structures.},
	year = {2026},
	eissn = {1572-9222},
	pages = {1-35},
	orcid-numbers = {Benedek, Gábor István/0009-0009-0831-0330; Krisztin, Tibor/0000-0001-6018-8840}
}

@article{MTMT:35803034,
	title = {Morse Decomposition of Scalar Differential Equations with State-Dependent Delay},
	url = {https://m2.mtmt.hu/api/publication/35803034},
	author = {Bartha, Ferenc Ágoston and Garab, Ábel and Krisztin, Tibor},
	doi = {10.1007/s10884-025-10414-w},
	journal-iso = {J DYN DIFFER EQU},
	journal = {JOURNAL OF DYNAMICS AND DIFFERENTIAL EQUATIONS},
	volume = {38},
	unique-id = {35803034},
	issn = {1040-7294},
	abstract = {We consider state-dependent delay differential equations of the form \begin{aligned} \dot{x}(t) = f(x(t), x(t - r(x_t))), \end{aligned} x ˙ ( t ) = f ( x ( t ) , x ( t - r ( x t ) ) ) , where f is continuously differentiable and fulfills a negative feedback condition in the delayed term. Under suitable conditions on r and f , we construct a Morse decomposition of the global attractor, giving some insight into the global dynamics. The Morse sets in the decomposition are closely related to the level sets of an integer-valued Lyapunov function that counts the number of sign changes along solutions on intervals of length of the delay. This generalizes former results for constant delay. We also give two major types of state-dependent delays for which our results apply.},
	year = {2026},
	eissn = {1572-9222},
	pages = {449-479},
	orcid-numbers = {Bartha, Ferenc Ágoston/0000-0002-7545-9145; Garab, Ábel/0000-0001-9693-1923; Krisztin, Tibor/0000-0001-6018-8840}
}

@article{MTMT:35809690,
	title = {General sharp upper bounds on the transversal coalition number},
	url = {https://m2.mtmt.hu/api/publication/35809690},
	author = {Blázsik, Zoltán},
	doi = {10.1016/j.dam.2025.08.019},
	journal-iso = {DISCRETE APPL MATH},
	journal = {DISCRETE APPLIED MATHEMATICS},
	volume = {378},
	unique-id = {35809690},
	issn = {0166-218X},
	abstract = {Let $\mathcal{H}(V,E)$ be a finite hypergraph with vertex set $V$ and edge set $E$ such that every hyperedge is non-empty. Two disjoint sets $A,B\subset V$ form a transversal coalition in $\mathcal{H}$, if none of them is a transversal, but their union $A\cup B$ is a transversal. A vertex partition $\Psi=\{V_1,V_2,\dots,V_p\}$ is a transversal coalition partition, if none of the partition classes is a transversal, meanwhile for every $i\in\{1,2,\dots,p\}$ there exists a distinct $j\in\{1,2,\dots,p\}$ such that $V_i$ and $V_j$ form a transversal coalition. The maximum cardinality of a transversal coalition partition of $\mathcal{H}$ is the transversal coalition number of $\mathcal{H}$ and denoted by $C_{\tau}(\mathcal{H})$. We generalize the previous upper bounds of Barát and Blázsik on the total coalition number by using the open neighborhood hypergraph construction. This connection was recently pointed out by Henning and Yeo and they proved similar upper bounds on the transversal coalition number for $k$-uniform hypergraphs. We also generalize their results by omitting the uniformity constraint. We give upper bounds in terms of the minimum and maximum size of the hyperedges. We further investigate this optimal case and study the transversal coalition graph. We prove that the possible optimal transversal coalition graphs are exactly the same as the optimal total coalition graphs.We show that every graph can be realised as a transversal coalition graph.},
	keywords = {Total domination in graphs; transversal coalition; open neighborhood hypergraph},
	year = {2026},
	eissn = {1872-6771},
	pages = {384-391},
	orcid-numbers = {Blázsik, Zoltán/0000-0003-1877-9983}
}

@article{MTMT:36289284,
	title = {The random generation of Latin rectangles based on the assignment problem},
	url = {https://m2.mtmt.hu/api/publication/36289284},
	author = {Iftikhar, Fariha and Nagy, Gábor Péter},
	doi = {10.1016/j.dam.2025.07.049},
	journal-iso = {DISCRETE APPL MATH},
	journal = {DISCRETE APPLIED MATHEMATICS},
	volume = {378},
	unique-id = {36289284},
	issn = {0166-218X},
	abstract = {We investigate the random generation of Latin rectangles using a method based on the assignment problem. Specifically, each row is selected via a minimum-cost permutation from a randomly generated cost matrix. This approach defines a convex polytope for each Latin rectangle, where the volume of the polytope determines the sampling probability of the corresponding rectangle. Our analysis reveals that the resulting process is efficient but generally non-uniform, thereby providing a negative answer to a question posed by the second author in 2009. Furthermore, we establish that the volume of the polytope is invariant under column and symbol permutations of the rectangles.},
	year = {2026},
	eissn = {1872-6771},
	pages = {329-336},
	orcid-numbers = {Nagy, Gábor Péter/0000-0002-9558-4197}
}

@article{MTMT:36344314,
	title = {Discrete Lyapunov functional for cyclic systems of differential equations with time-variable or state-dependent delay},
	url = {https://m2.mtmt.hu/api/publication/36344314},
	author = {Balázs, István and Garab, Ábel},
	doi = {10.1016/j.jde.2025.113768},
	journal-iso = {J DIFFER EQUATIONS},
	journal = {JOURNAL OF DIFFERENTIAL EQUATIONS},
	volume = {452},
	unique-id = {36344314},
	issn = {0022-0396},
	year = {2026},
	eissn = {1090-2732},
	orcid-numbers = {Balázs, István/0000-0003-2217-4960; Garab, Ábel/0000-0001-9693-1923}
}

@article{MTMT:36362734,
	title = {Total coalitions in claw-free cubic graphs containing double-bonded triangle-units},
	url = {https://m2.mtmt.hu/api/publication/36362734},
	author = {Blázsik, Zoltán and Michael, A. Henning and Shahin, N. Jogan},
	doi = {10.1007/s00373-026-03012-0},
	journal-iso = {GRAPH COMBINATOR},
	journal = {GRAPHS AND COMBINATORICS},
	volume = {42},
	unique-id = {36362734},
	issn = {0911-0119},
	year = {2026},
	eissn = {1435-5914},
	orcid-numbers = {Blázsik, Zoltán/0000-0003-1877-9983}
}

@article{MTMT:36382830,
	title = {The Möbius–Kantor graph is a faithful unit-distance graph},
	url = {https://m2.mtmt.hu/api/publication/36382830},
	author = {Bašić, Nino and Gévay, Gábor and Pisanski, Tomaž},
	doi = {10.26493/2590-9770.1914.42a},
	journal-iso = {ADAM},
	journal = {ART OF DISCRETE AND APPLIED MATHEMATICS},
	volume = {9},
	unique-id = {36382830},
	year = {2026},
	eissn = {2590-9770},
	orcid-numbers = {Gévay, Gábor/0000-0002-5469-5165}
}