Péter Hajnal

Available identifiers

zbMath Open hajnal.peterWikidataQ102117385 ScholiaQ102117385MaRDI QIDQ215793

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5882319	2023-03-15	Paper
A short note on Layman permutations	2023-02-21	Paper
Nearest neighbor representations of Boolean functions	2022-06-08	Paper
Combinatorial properties of poly-Bernoulli relatives	2019-06-21	Paper
Two geometrical applications of the semi-random method	2019-06-12	Paper
Poly-Bernoulli Numbers and Eulerian Numbers	2018-08-16	Paper
Saturated simple and 2-simple topological graphs with few edges	2018-01-12	Paper
Combinatorics of poly-Bernoulli numbers	2017-03-31	Paper
Saturated Simple and 2-simple Topological Graphs with Few Edges	2016-10-21	Paper
Convex Polygons and Common Transversals	2016-06-16	Paper
On the staircases of Gyárfás	2016-05-11	Paper
A bijective proof of Shapiro's Catalan convolution	2014-09-04	Paper
On the structure of graphs with path-width at most two	2012-09-17	Paper
Elementary proof techniques for the maximum number of islands	2011-01-07	Paper
Simply sequentially additive labelings of 2-regular graphs	2010-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q3436115	2007-05-08	Paper
Operations Which Preserve Path-Width at Most Two	2002-06-03	Paper
The arc-width of a graph	2001-12-11	Paper
Analysis of permutation routing algorithms	2000-09-14	Paper
Partition problems and kernels of graphs	1999-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q3137188	1994-04-13	Paper
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs	1994-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q3137193	1993-11-01	Paper
On packing bipartite graphs	1993-01-17	Paper
Davenport-Schinzel theory of matrices	1992-12-06	Paper
An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties	1992-06-27	Paper
A lower bound on the number of unit distances between the vertices of a convex polygon	1992-06-25	Paper
Brooks Coloring in Parallel	1990-01-01	Paper
Analysis of an Infinite Product Algorithm	1989-01-01	Paper
Transversals for ordinal intervals	1987-01-01	Paper
A lower bound for read-once-only branching programs	1987-01-01	Paper
Partition of graphs with condition on the connectivity and minimum degree	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Péter Hajnal