János Barát

From MaRDI portal
(Redirected from Person:215792)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On the number of \(A\)-transversals in hypergraphs
Periodica Mathematica Hungarica
2024-09-19Paper
On the number of edges in a \(K_5\)-minor-free graph of given girth
Discrete Mathematics
2024-05-21Paper
Improved upper bound on the Frank number of 3-edge-connected graphs
European Journal of Combinatorics
2024-03-26Paper
Monochromatic spanning trees and matchings in ordered complete graphs
Journal of Graph Theory
2024-02-23Paper
Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited
Journal of Combinatorial Designs
2024-02-01Paper
Quest for graphs of Frank number 32024-01-17Paper
Quest for graphs of Frank number 3
(available as arXiv preprint)
2024-01-17Paper
The double Hall property and cycle covers in bipartite graphs2023-10-04Paper
Saturated 2-plane drawings with few edges
Ars Mathematica Contemporanea
2023-09-13Paper
Extremal \(K_4\)-minor-free graphs without short cycles
Periodica Mathematica Hungarica
2023-04-04Paper
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen
Discrete Mathematics
2023-02-21Paper
General sharp upper bounds on the total coalition number2023-01-24Paper
On the number of $A$-transversals in hypergraphs2022-11-25Paper
Improvement on the crossing number of crossing-critical graphs
Discrete & Computational Geometry
2022-03-21Paper
The horizon of 2-dichromatic oriented graphs2022-01-31Paper
Improvement on the Crossing Number of Crossing-Critical Graphs
Lecture Notes in Computer Science
2021-12-01Paper
Extremal $K_4$-minor-free graphs without short cycles
(available as arXiv preprint)
2021-11-10Paper
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen
(available as arXiv preprint)
2021-08-18Paper
Improvement on the crossing number of crossing-critical graphs
(available as arXiv preprint)
2020-03-03Paper
Transversals in generalized Latin squares
Ars Mathematica Contemporanea
2019-07-25Paper
Decomposition of cubic graphs related to Wegner's conjecture
Discrete Mathematics
2019-03-25Paper
Decomposition of cubic graphs related to Wegner's conjecture
Discrete Mathematics
2019-03-25Paper
A family of extremal hypergraphs for Ryser's conjecture
Journal of Combinatorial Theory. Series A
2018-11-08Paper
A family of extremal hypergraphs for Ryser's conjecture
Journal of Combinatorial Theory. Series A
2018-11-08Paper
Improvements on the density of maximal 1-planar graphs
Journal of Graph Theory
2018-07-13Paper
Improvements on the density of maximal 1-planar graphs
Journal of Graph Theory
2018-07-13Paper
Rainbow matchings in bipartite multigraphs
Periodica Mathematica Hungarica
2017-04-25Paper
Rainbow matchings in bipartite multigraphs
Periodica Mathematica Hungarica
2017-04-25Paper
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Journal of Graph Theory
2016-04-15Paper
Ramsey number of paths and connected matchings in Ore-type host graphs
Discrete Mathematics
2016-04-08Paper
Multipartite hypergraphs achieving equality in Ryser's conjecture
Graphs and Combinatorics
2016-03-02Paper
Multipartite hypergraphs achieving equality in Ryser's conjecture
Graphs and Combinatorics
2016-03-02Paper
Empty pentagons in point sets with collinearities
SIAM Journal on Discrete Mathematics
2015-11-27Paper
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Combinatorica
2015-01-07Paper
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Combinatorica
2015-01-07Paper
Edge-decomposition of graphs into copies of a tree with four edges
The Electronic Journal of Combinatorics
2014-09-04Paper
Edge-decomposition of graphs into copies of a tree with four edges
The Electronic Journal of Combinatorics
2014-09-04Paper
Rainbow matchings and transversals
The Australasian Journal of Combinatorics
2014-08-15Paper
Large \(B_d\)-free and union-free subfamilies2013-11-01Paper
Large \(B_d\)-free and union-free subfamilies
(available as arXiv preprint)
2013-11-01Paper
Facial nonrepetitive vertex coloring of plane graphs
Journal of Graph Theory
2013-10-09Paper
A cube dismantling problem related to bootstrap percolation
Journal of Statistical Physics
2013-02-25Paper
On the structure of graphs with path-width at most two
Studia Scientiarum Mathematicarum Hungarica
2012-09-17Paper
Large \(B_d\)-free and union-free subfamilies
SIAM Journal on Discrete Mathematics
2012-08-22Paper
Disproof of the list Hadwiger conjecture
The Electronic Journal of Combinatorics
2012-03-06Paper
Disproof of the list Hadwiger conjecture
The Electronic Journal of Combinatorics
2012-03-06Paper
On square-free edge colorings of graphs2011-02-02Paper
Elementary proof techniques for the maximum number of islands
European Journal of Combinatorics
2011-01-07Paper
What is on his mind?
Discrete Mathematics
2010-10-18Paper
Towards the Albertson conjecture
The Electronic Journal of Combinatorics
2010-06-16Paper
Towards the Albertson conjecture
The Electronic Journal of Combinatorics
2010-06-16Paper
Towards the Albertson conjecture
The Electronic Journal of Combinatorics
2010-06-16Paper
On winning fast in Avoider-Enforcer games
The Electronic Journal of Combinatorics
2010-06-16Paper
On winning fast in Avoider-Enforcer games
The Electronic Journal of Combinatorics
2010-06-16Paper
On winning fast in Avoider-Enforcer games
The Electronic Journal of Combinatorics
2010-06-16Paper
Notes on nonrepetitive graph colouring
The Electronic Journal of Combinatorics
2009-04-07Paper
Notes on nonrepetitive graph colouring
The Electronic Journal of Combinatorics
2009-04-07Paper
Notes on nonrepetitive graph colouring
The Electronic Journal of Combinatorics
2009-04-07Paper
On square-free vertex colorings of graphs
Studia Scientiarum Mathematicarum Hungarica
2008-11-19Paper
2-star-coloring of graphs
Electronic Notes in Discrete Mathematics
2007-05-29Paper
scientific article; zbMATH DE number 5150168 (Why is no real title available?)2007-05-08Paper
Directed path-width and monotonicity in digraph searching
Graphs and Combinatorics
2006-09-12Paper
A contribution to queens graphs: a substitution method
Discrete Mathematics
2006-08-04Paper
Claw‐decompositions and tutte‐orientations
Journal of Graph Theory
2006-06-06Paper
Note on disjoint blocking sets in Galois planes
Journal of Combinatorial Designs
2006-05-16Paper
Bounded-degree graphs have arbitrarily large geometric thickness
The Electronic Journal of Combinatorics
2006-01-17Paper
Bounded-degree graphs have arbitrarily large geometric thickness
The Electronic Journal of Combinatorics
2006-01-17Paper
A contribution to infinite disjoint covering systems
Journal de Théorie des Nombres de Bordeaux
2005-09-15Paper
A contribution to infinite disjoint covering systems
Journal de Théorie des Nombres de Bordeaux
2005-09-15Paper
A contribution to infinite disjoint covering systems
Journal de Théorie des Nombres de Bordeaux
2005-09-15Paper
scientific article; zbMATH DE number 2114676 (Why is no real title available?)2004-11-11Paper
Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)
Designs, Codes and Cryptography
2004-08-16Paper
Partitioning the positive integers to seven Beatty sequences
Indagationes Mathematicae. New Series
2004-06-15Paper
Minimal blocking sets in \(PG(2,8)\) and maximal partial spreads in \(PG(3,8)\)
Designs, Codes and Cryptography
2004-06-11Paper
Largest minimal blocking sets in PG(2,8)
Journal of Combinatorial Designs
2003-05-22Paper
Operations which preserve path-width at most two
Combinatorics, Probability and Computing
2002-06-03Paper
The arc-width of a graph
The Electronic Journal of Combinatorics
2001-12-11Paper
The arc-width of a graph
The Electronic Journal of Combinatorics
2001-12-11Paper


Research outcomes over time


This page was built for person: János Barát