János Barát

From MaRDI portal
Revision as of 12:55, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:215792

Available identifiers

zbMath Open barat.janosMaRDI QIDQ215792

List of research outcomes





PublicationDate of PublicationType
On the number of \(A\)-transversals in hypergraphs2024-09-19Paper
On the number of edges in a \(K_5\)-minor-free graph of given girth2024-05-21Paper
Improved upper bound on the Frank number of 3-edge-connected graphs2024-03-26Paper
Monochromatic spanning trees and matchings in ordered complete graphs2024-02-23Paper
Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited2024-02-01Paper
https://portal.mardi4nfdi.de/entity/Q61775812024-01-17Paper
The double Hall property and cycle covers in bipartite graphs2023-10-04Paper
Saturated 2-plane drawings with few edges2023-09-13Paper
Extremal \(K_4\)-minor-free graphs without short cycles2023-04-04Paper
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen2023-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 graphs2022-03-21Paper
The horizon of 2-dichromatic oriented graphs2022-01-31Paper
Improvement on the Crossing Number of Crossing-Critical Graphs2021-12-01Paper
Extremal $K_4$-minor-free graphs without short cycles2021-11-10Paper
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen2021-08-18Paper
Improvement on the crossing number of crossing-critical graphs2020-03-03Paper
Transversals in generalized Latin squares2019-07-25Paper
Decomposition of cubic graphs related to Wegner's conjecture2019-03-25Paper
A family of extremal hypergraphs for Ryser's conjecture2018-11-08Paper
Improvements on the density of maximal 1‐planar graphs2018-07-13Paper
Rainbow matchings in bipartite multigraphs2017-04-25Paper
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles2016-04-15Paper
Ramsey number of paths and connected matchings in Ore-type host graphs2016-04-08Paper
Multipartite hypergraphs achieving equality in Ryser's conjecture2016-03-02Paper
Empty Pentagons in Point Sets with Collinearities2015-11-27Paper
Partitioning 2-edge-colored graphs by monochromatic paths and cycles2015-01-07Paper
Edge-decomposition of graphs into copies of a tree with four edges2014-09-04Paper
https://portal.mardi4nfdi.de/entity/Q28760392014-08-15Paper
Large B_d-free and union-free subfamilies2013-11-01Paper
Facial Nonrepetitive Vertex Coloring of Plane Graphs2013-10-09Paper
A cube dismantling problem related to bootstrap percolation2013-02-25Paper
On the structure of graphs with path-width at most two2012-09-17Paper
Large $B_d$-Free and Union-free Subfamilies2012-08-22Paper
Disproof of the list Hadwiger conjecture2012-03-06Paper
https://portal.mardi4nfdi.de/entity/Q30702982011-02-02Paper
Elementary proof techniques for the maximum number of islands2011-01-07Paper
What is on his mind?2010-10-18Paper
On winning fast in Avoider-Enforcer games2010-06-16Paper
Towards the Albertson conjecture2010-06-16Paper
Notes on nonrepetitive graph colouring2009-04-07Paper
On square-free vertex colorings of graphs2008-11-19Paper
2-star-coloring of graphs2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34361152007-05-08Paper
Directed path-width and monotonicity in digraph searching2006-09-12Paper
A contribution to queens graphs: a substitution method2006-08-04Paper
Claw‐decompositions and tutte‐orientations2006-06-06Paper
Note on disjoint blocking sets in Galois planes2006-05-16Paper
Bounded-degree graphs have arbitrarily large geometric thickness2006-01-17Paper
A contribution to infinite disjoint covering systems2005-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48262692004-11-11Paper
Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)2004-08-16Paper
Partitioning the positive integers to seven Beatty sequences2004-06-15Paper
Minimal blocking sets in \(PG(2,8)\) and maximal partial spreads in \(PG(3,8)\)2004-06-11Paper
Largest minimal blocking sets in PG(2,8)2003-05-22Paper
Operations Which Preserve Path-Width at Most Two2002-06-03Paper
The arc-width of a graph2001-12-11Paper

Research outcomes over time

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