The following pages link to Ervin Gyoeri (Q1165243):
Displaying 50 items.
- (Q201985) (redirect page) (← links)
- A list version of graph packing (Q284763) (← links)
- Toward Żak's conjecture on graph packing (Q286756) (← links)
- Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970) (← links)
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem (Q340521) (← links)
- Hypergraphs with no cycle of length 4 (Q411654) (← links)
- Richard Schelp (1936-2010) (Q432697) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- Note on terminal-pairability in complete grid graphs (Q512572) (← links)
- On the rainbow Turán number of paths (Q668069) (← links)
- Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs (Q709323) (← links)
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- A minimax theorem on intervals (Q801077) (← links)
- The maximum Wiener index of maximal planar graphs (Q830949) (← links)
- Pentagons vs. triangles (Q941370) (← links)
- Connected graphs without long paths (Q941391) (← links)
- On a problem of Erdős on integers, none of which divides the product of \(k\) others (Q1041201) (← links)
- A new type of edge-derived vertex coloring (Q1045165) (← links)
- On the edge numbers of graphs with Hadwiger number 4 and 5 (Q1055783) (← links)
- (Q1063612) (redirect page) (← links)
- Covering simply connected regions by rectangles (Q1063613) (← links)
- The number of small semispaces of a finite set of points in the plane (Q1070228) (← links)
- Any four independent edges of a 4-connected graph are contained in a circuit (Q1073040) (← links)
- On the number of \(C_ 5's\) in a triangle-free graph (Q1124605) (← links)
- An \(n\)-dimensional search problem with restricted questions (Q1165244) (← links)
- Partition conditions and vertex-connectivity of graphs (Q1168985) (← links)
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs (Q1175549) (← links)
- On the number of edge disjoint cliques in graphs of given size (Q1180425) (← links)
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable (Q1197017) (← links)
- A theorem of the transversal theory for matroids of finite character (Q1250105) (← links)
- On the structures induced by bipartite graphs and infinite matroids (Q1254325) (← links)
- How to make a graph four-connected (Q1300060) (← links)
- Graphs without short odd cycles are nearly bipartite (Q1356557) (← links)
- \(C_ 6\)-free bipartite graphs and product representation of squares (Q1356758) (← links)
- Nearly bipartite graphs (Q1412666) (← links)
- Two-edge colorings of graphs with bounded degree in both colors (Q1598846) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- An Erdős-Gallai type theorem for uniform hypergraphs (Q1686258) (← links)
- 3-uniform hypergraphs and linear cycles (Q1689945) (← links)
- A note on the maximum number of triangles in a \(C_5\)-free graph (Q1689946) (← links)
- Terminal-pairability in complete bipartite graphs (Q1693175) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Mobile versus point guards (Q1716007) (← links)
- A note on the linear cycle cover conjecture of Gyárfás and Sárközy (Q1753119) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- Vertex-disjoint cycles containing specified edges (Q1972323) (← links)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
- The structure of hypergraphs without long Berge cycles (Q1998768) (← links)
- Edge colorings of graphs without monochromatic stars (Q2005736) (← links)
