The following pages link to József Balogh (Q189372):
Displaying 50 items.
- Triangle factors of graphs without large independent sets and of weighted graphs (Q2953695) (← links)
- Applications of graph containers in the Boolean lattice (Q2953701) (← links)
- Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges (Q3008023) (← links)
- The diameter game (Q3055780) (← links)
- Excluding induced subgraphs: Critical graphs (Q3068762) (← links)
- Local resilience of almost spanning trees in random graphs (Q3068763) (← links)
- Some exact Ramsey-Turán numbers (Q3144853) (← links)
- Graph bootstrap percolation (Q3145835) (← links)
- Triangle-Tilings in Graphs Without Large Independent Sets (Q3177358) (← links)
- On the number of generalized Sidon sets (Q3382921) (← links)
- On the First-Fit Chromatic Number of Graphs (Q3393424) (← links)
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups (Q3412104) (← links)
- Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position (Q3419616) (← links)
- Bootstrap percolation on the random regular graph (Q3419621) (← links)
- (Q3424882) (← links)
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM (Q3449986) (← links)
- THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS (Q3449989) (← links)
- On the Decay of Crossing Numbers of Sparse Graphs (Q3466340) (← links)
- Index Assignment for Two-Channel Quantization (Q3546528) (← links)
- Erdős–Ko–Rado in Random Hypergraphs (Q3552495) (← links)
- Sizes of Induced Subgraphs of Ramsey Graphs (Q3552509) (← links)
- Majority Bootstrap Percolation on the Hypercube (Q3557503) (← links)
- On Avoider-Enforcer Games (Q3563950) (← links)
- The typical structure of graphs without given excluded subgraphs (Q3633015) (← links)
- (Q4212889) (← links)
- The Number of Subsets of Integers with No<i>k</i>-Term Arithmetic Progression (Q4612054) (← links)
- On the number of points in general position in the plane (Q4645041) (← links)
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES (Q4657678) (← links)
- Hereditary properties of words (Q4680726) (← links)
- A sharp edge bound on the interval number of a graph (Q4700529) (← links)
- Random disease on the square grid (Q4705343) (← links)
- On the interval number of special graphs (Q4810499) (← links)
- Bootstrap Percolation in High Dimensions (Q4911107) (← links)
- Turán Densities of Some Hypergraphs Related to $K_{k+1}^{k}$ (Q4915190) (← links)
- Towards a Weighted Version of the Hajnal–Szemerédi Theorem (Q4921565) (← links)
- River landscapes and optimal channel networks (Q4967444) (← links)
- A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree (Q5001841) (← links)
- On Generalized Turán Results in Height Two Posets (Q5088600) (← links)
- On the number of linear hypergraphs of large girth (Q5110647) (← links)
- THE METHOD OF HYPERGRAPH CONTAINERS (Q5122147) (← links)
- An efficient container lemma (Q5144433) (← links)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (Q5204070) (← links)
- Tilings in Randomly Perturbed Dense Graphs (Q5219315) (← links)
- Closing in on Hill's Conjecture (Q5232152) (← links)
- Independent sets in hypergraphs (Q5247664) (← links)
- Book Embeddings of Regular Graphs (Q5254031) (← links)
- The Klee–Minty random edge chain moves with linear speed (Q5297136) (← links)
- On Two Problems in Ramsey--Turán Theory (Q5351866) (← links)
- An improved lower bound for Folkman's theorem (Q5357107) (← links)
