The following pages link to József Balogh (Q189372):
Displaying 50 items.
- Minimum Number of Monotone Subsequences of Length 4 in Permutations (Q5364246) (← links)
- On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)
- The sharp threshold for bootstrap percolation in all dimensions (Q5390256) (← links)
- The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs (Q5392190) (← links)
- A refinement of the Cameron-Erdős conjecture (Q5398437) (← links)
- On the Tree Packing Conjecture (Q5408605) (← links)
- Hereditary properties of combinatorial structures: Posets and oriented graphs (Q5434263) (← links)
- (Q5442375) (← links)
- Graphs Having Small Number of Sizes on Induced k‐Subgraphs (Q5454277) (← links)
- (Q5485345) (← links)
- Graph Drawing (Q5711628) (← links)
- Mantel's theorem for random hypergraphs (Q5740269) (← links)
- Making <i>K</i><sub><i>r</i>+1</sub>-free graphs <i>r</i>-partite (Q5886101) (← links)
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree (Q5886310) (← links)
- The penultimate rate of growth for graph properties (Q5937420) (← links)
- Measures on monotone properties of graphs (Q5957296) (← links)
- An Upper Bound on the Size of Sidon Sets (Q6042555) (← links)
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs (Q6074587) (← links)
- Sharp threshold for the Erdős–Ko–Rado theorem (Q6077048) (← links)
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs (Q6081557) (← links)
- Ramsey upper density of infinite graph factors (Q6100872) (← links)
- Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm (Q6133947) (← links)
- Families in posets minimizing the number of comparable pairs (Q6134650) (← links)
- Intersecting families of sets are typically trivial (Q6144393) (← links)
- The Spectrum of Triangle-Free Graphs (Q6157996) (← links)
- On the sizes of \(t\)-intersecting \(k\)-chain-free families (Q6179322) (← links)
- Ramsey-Turán problems with small independence numbers (Q6201873) (← links)
- Unavoidable order-size pairs in hypergraphs -- positive forcing density (Q6204681) (← links)
- Tur\'an density of long tight cycle minus one hyperedge (Q6509228) (← links)
- On a Traveling Salesman Problem for Points in the Unit Cube (Q6513418) (← links)
- Partitioning the hypercube into smaller hypercubes (Q6515610) (← links)
- On the Constructor-Blocker Game (Q6515645) (← links)
- A note on colour-bias perfect matchings in hypergraphs (Q6519547) (← links)
- On multicolor Tur\'an numbers (Q6520803) (← links)
- On the maximum number of $r$-cliques in graphs free of complete $r$-partite subgraphs (Q6523521) (← links)
- Grid-drawings of graphs in three-dimensions (Q6528991) (← links)
- Generalized Ramsey-Tur\'an Numbers (Q6533092) (← links)
- Proper elements of Coxeter groups (Q6564862) (← links)
- On multicolor Turán numbers (Q6594389) (← links)
- 10 problems for partitions of triangle-free graphs (Q6612517) (← links)
- On a traveling salesman problem for points in the unit cube (Q6614116) (← links)
- Short proofs of three results about intersecting systems (Q6615491) (← links)
- Maximum induced subgraphs of the binomial random graph (Q6621156) (← links)
- A note on color-bias perfect matchings in hypergraphs (Q6622736) (← links)
- On oriented cycles in randomly perturbed digraphs (Q6632800) (← links)
- Turán density of long tight cycle minus one hyperedge (Q6662684) (← links)
- On the Constructor-Blocker game (Q6667585) (← links)
- On the number of $P$-free set systems for tree posets $P$ (Q6728917) (← links)
- On the maximum $F$-free induced subgraphs in $K_t$-free graphs (Q6733284) (← links)
- Sunflowers in set systems with small VC-dimension (Q6739731) (← links)
