The following pages link to János Barát (Q215792):
Displaying 50 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Rainbow matchings in bipartite multigraphs (Q524181) (← links)
- Elementary proof techniques for the maximum number of islands (Q616385) (← links)
- Disproof of the list Hadwiger conjecture (Q665753) (← links)
- What is on his mind? (Q709300) (← links)
- On winning fast in Avoider-Enforcer games (Q976704) (← links)
- Towards the Albertson conjecture (Q976729) (← links)
- Notes on nonrepetitive graph colouring (Q1010826) (← links)
- (Q1431619) (redirect page) (← links)
- Minimal blocking sets in \(PG(2,8)\) and maximal partial spreads in \(PG(3,8)\) (Q1431621) (← links)
- Partitioning the positive integers to seven Beatty sequences (Q1433040) (← links)
- A family of extremal hypergraphs for Ryser's conjecture (Q1621417) (← links)
- Decomposition of cubic graphs related to Wegner's conjecture (Q1732787) (← links)
- Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\) (Q1876074) (← links)
- A cube dismantling problem related to bootstrap percolation (Q1938846) (← links)
- Improvement on the crossing number of crossing-critical graphs (Q2117357) (← links)
- A contribution to infinite disjoint covering systems (Q2388607) (← links)
- A contribution to queens graphs: a substitution method (Q2497488) (← links)
- Directed path-width and monotonicity in digraph searching (Q2502026) (← links)
- Bounded-degree graphs have arbitrarily large geometric thickness (Q2583678) (← links)
- Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen (Q2685314) (← links)
- Extremal \(K_4\)-minor-free graphs without short cycles (Q2694910) (← links)
- Operations Which Preserve Path-Width at Most Two (Q2757072) (← links)
- Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590) (← links)
- Facial Nonrepetitive Vertex Coloring of Plane Graphs (Q2852615) (← links)
- Large B_d-free and union-free subfamilies (Q2857326) (← links)
- (Q2876039) (← links)
- Large $B_d$-Free and Union-free Subfamilies (Q2902889) (← links)
- On the structure of graphs with path-width at most two (Q2915439) (← links)
- (Q3070298) (← links)
- (Q3436115) (← links)
- 2-star-coloring of graphs (Q3438936) (← links)
- Empty Pentagons in Point Sets with Collinearities (Q3453574) (← links)
- On square-free vertex colorings of graphs (Q3539570) (← links)
- Improvements on the density of maximal 1‐planar graphs (Q4575520) (← links)
- Largest minimal blocking sets in PG(2,8) (Q4808409) (← links)
- (Q4826269) (← links)
- Improvement on the Crossing Number of Crossing-Critical Graphs (Q5014130) (← links)
- Transversals in generalized Latin squares (Q5225021) (← links)
- Note on disjoint blocking sets in Galois planes (Q5469153) (← links)
- Claw‐decompositions and tutte‐orientations (Q5471011) (← links)
- The arc-width of a graph (Q5949342) (← links)
- Multipartite hypergraphs achieving equality in Ryser's conjecture (Q5964971) (← links)
- Saturated 2-plane drawings with few edges (Q6094179) (← links)
- Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited (Q6188119) (← links)
- Monochromatic spanning trees and matchings in ordered complete graphs (Q6199379) (← links)
- Improved upper bound on the Frank number of 3-edge-connected graphs (Q6201894) (← links)
- The double Hall property and cycle covers in bipartite graphs (Q6453802) (← links)
