The following pages link to Peter Horák (Q215558):
Displayed 50 items.
- Greedy clique decompositions and the Turán numbers (Q1896337) (← links)
- Strength and fractional arboricity of complementary graphs (Q1897432) (← links)
- The isomorphic factorization of complete tripartite graphs \(K(m,n,s)\).--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure (Q1901045) (← links)
- New asymptotics for bipartite Turán numbers (Q1919672) (← links)
- Hamiltonian square-paths (Q1924142) (← links)
- On the number of edges of quadrilateral-free graphs (Q1924153) (← links)
- More broadcast graphs (Q1961235) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- On the Hajós number of graphs (Q1970708) (← links)
- A direct proof of Shapley-Sperner's lemma based on the KKMS lemma (Q1996898) (← links)
- Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\) (Q2022162) (← links)
- On Hamiltonian cycles in hypergraphs with dense link graphs (Q2040014) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- The star dichromatic number (Q2062686) (← links)
- A note on prime labeling \(k\)-partite \(k\)-graphs (Q2163042) (← links)
- Locally Hamiltonian graphs and minimal size of maximal graphs on a surface (Q2185215) (← links)
- Perfect matchings in shadow colorings (Q2220968) (← links)
- Simple graph density inequalities with no sum of squares proofs (Q2221001) (← links)
- Tiling \(\mathbb R^5\) by crosses (Q2250044) (← links)
- On 2-factor Hamiltonian regular bipartite graphs (Q2250805) (← links)
- The existence of 2-balanced Mendelsohn triple systems (Q2279975) (← links)
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays (Q2279982) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Speeding up deciphering by hypergraph ordering (Q2339143) (← links)
- An \(L\)-system on the small Witt design (Q2368651) (← links)
- Erdős--Ko--Rado for three sets (Q2368657) (← links)
- A combinatorial problem related to sparse systems of equations (Q2402975) (← links)
- Minimal normal graph covers (Q2416445) (← links)
- More orthogonal double covers of complete graphs by Hamiltonian paths (Q2427509) (← links)
- Tripling construction for large sets of resolvable directed triple systems (Q2431920) (← links)
- A generalization of Lee codes (Q2436575) (← links)
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs (Q2448961) (← links)
- Profile polytopes of some classes of families (Q2448967) (← links)
- On biclique coverings (Q2468013) (← links)
- The intersection problem for \(\text{PBD}(5^{*},3)\)s (Q2468021) (← links)
- Characterization of product anti-magic graphs of large order (Q2478164) (← links)
- The prism over the middle-levels graph is Hamiltonian (Q2490424) (← links)
- The maximum size of 4-wise 2-intersecting and 4-wise 2-union families (Q2493102) (← links)
- Bounding the number of circuits of a graph (Q2563510) (← links)
- On the chromatic number of Steiner triple systems of order 25 (Q2568479) (← links)
- Extended Petersen graphs (Q2568480) (← links)
- Ore-type degree condition for heavy paths in weighted graphs (Q2570107) (← links)
- A Sperner-type theorem for set-partition systems (Q2571313) (← links)
- On the maximum number of cycles in a Hamiltonian graph (Q2576841) (← links)
- A proof of an inequality concerning \(k\)-restricted edge connectivity (Q2576846) (← links)
- Extending partial 5-colorings and 6-colorings in planar graphs (Q2581502) (← links)
- Locally restricted colorings (Q2581565) (← links)
- On oriented \(L(p,1)\)-labeling (Q2636569) (← links)
- A new approach towards the Golomb-Welch conjecture (Q2637233) (← links)
- Intersecting families of finite sets and fixed-point-free 2-elements (Q2641300) (← links)