235 results on '"GYŐRI, ERVIN"'
Search Results
202. Covering the edges of a graph with triangles.
203. The maximum number of triangles in [formula omitted]-free graphs.
204. Polygonal Graphs
205. Combinatorial Conditions for the Rigidity of Tensegrity Frameworks
206. Subsums of a Finite Sum and Extremal Sets of Vertices of the Hypercube
207. Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
208. Old and New Problems and Results in Ramsey Theory
209. Proof Techniques for Factor Theorems
210. Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects
211. The Random Walk Method for Intersecting Families
212. Statistical Inference on Random Structures
213. Ballot Theorems, Old and New
214. Random Discrete Matrices
215. Problems and Results on Colorings of Mixed Hypergraphs
216. Infinite Combinatorics: From Finite to Infinite
217. Perfect Powers in Products with Consecutive Terms from Arithmetic Progressions
218. A Quick Proof of Sprindzhuk’s Decomposition Theorem
219. Color-Critical Graphs and Hypergraphs with Few Edges: A Survey
220. The Topological Version of Fodor’s Theorem
221. Periodicity and Almost-Periodicity
222. Biplanar Crossing Numbers I: A Survey of Results and Problems
223. Edge-Connection of Graphs, Digraphs, and Hypergraphs
224. Bounds and Extrema for Classes of Graphs and Finite Structures
225. An Exercise on the Average Number of Real Zeros of Random Real Polynomials
226. Discrepancy in Graphs and Hypergraphs
227. A Unifying Generalization of Sperner’s Theorem
228. Extremal Functions for Graph Minors
229. A Lifting Theorem on Forcing LCS Spaces
230. Pseudo-random Graphs
231. Notes on CNS Polynomials and Integral Interpolation
232. On the Number of Additive Representations of Integers
233. The Evolution of an Idea — Gallai’s Algorithm
234. Relaxing Planarity for Topological Graphs
235. Recent Trends in Combinatorics: The Legacy of Paul Erdős
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.