The following pages link to József Balogh (Q189372):
Displaying 50 items.
- On perfect packings in dense graphs (Q1953444) (← links)
- On the Ramsey-Turán numbers of graphs and hypergraphs (Q1955731) (← links)
- Transitive triangle tilings in oriented graphs (Q1989953) (← links)
- Counting sum-free sets in abelian groups (Q2017119) (← links)
- Random sum-free subsets of abelian groups (Q2017135) (← links)
- Long rainbow arithmetic progressions (Q2041707) (← links)
- A strengthening of the Erdős-Szekeres theorem (Q2065993) (← links)
- On the number of sum-free triplets of sets (Q2121720) (← links)
- Tilings in vertex ordered graphs (Q2131863) (← links)
- Maximum determinant and permanent of sparse 0-1 matrices (Q2132515) (← links)
- Maximum number of almost similar triangles in the plane (Q2144458) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- On the discrepancies of graphs (Q2181999) (← links)
- Independent sets in the middle two layers of Boolean lattice (Q2221816) (← links)
- An analogue of the Erdős-Gallai theorem for random graphs (Q2225403) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube. II (Q2225404) (← links)
- Counting independent sets in regular hypergraphs (Q2229168) (← links)
- Intersecting families of discrete structures are typically trivial (Q2258906) (← links)
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs (Q2299254) (← links)
- The Ramsey number of Fano plane versus tight path (Q2309230) (← links)
- Ordered size Ramsey number of paths (Q2309545) (← links)
- Subdivisions of a large clique in \(C_6\)-free graphs (Q2343284) (← links)
- Phase transitions in Ramsey-Turán theory (Q2349511) (← links)
- On the number of union-free families (Q2357013) (← links)
- Unavoidable traces of set systems (Q2368593) (← links)
- A remark on the number of edge colorings of graphs (Q2368713) (← links)
- Large bounded degree trees in expanding graphs (Q2380438) (← links)
- Stability for vertex cycle covers (Q2401441) (← links)
- Monochromatic Hilbert cubes and arithmetic progressions (Q2415085) (← links)
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (Q2422235) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Almost all triple systems with independent neighborhoods are semi-bipartite (Q2431618) (← links)
- On the variance of Shannon products of graphs (Q2462357) (← links)
- A new short proof of a theorem of Ahlswede and Khachatrian (Q2474500) (← links)
- \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) (Q2498933) (← links)
- On the edge-bandwidth of graph products (Q2503283) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- The unlabelled speed of a hereditary graph property (Q2519010) (← links)
- Disjoint representability of sets and their complements (Q2565684) (← links)
- A jump to the Bell number for hereditary graph properties (Q2565685) (← links)
- Hypergraphs with zero chromatic threshold (Q2631069) (← links)
- Generalized rainbow Turán numbers of odd cycles (Q2666563) (← links)
- On the sizes of large subgraphs of the binomial random graph (Q2666567) (← links)
- The typical structure of sparse \(K_{r+1}\)-free graphs (Q2790735) (← links)
- Coloring some finite sets in \(\mathbb R^n\) (Q2866446) (← links)
- Corrádi and Hajnal's theorem for sparse random graphs (Q2883851) (← links)
- Complete minors, independent sets, and chordal graphs (Q2906352) (← links)
- The number of the maximal triangle-free graphs (Q2922865) (← links)
- The number of maximal sum-free subsets of integers (Q2944846) (← links)
