Found: 48
Select item for more details and to access through your institution.
Large cliques or cocliques in hypergraphs with forbidden order-size pairs.
- Published in:
- Combinatorics, Probability & Computing, 2024, v. 33, n. 3, p. 286, doi. 10.1017/S0963548323000433
- By:
- Publication type:
- Article
An Extremal Graph Problem with a Transcendental Solution.
- Published in:
- Combinatorics, Probability & Computing, 2019, v. 28, n. 2, p. 303, doi. 10.1017/S0963548318000299
- By:
- Publication type:
- Article
Multicolour Sunflowers.
- Published in:
- Combinatorics, Probability & Computing, 2018, v. 27, n. 6, p. 974, doi. 10.1017/S0963548318000160
- By:
- Publication type:
- Article
Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 5, p. 791, doi. 10.1017/S0963548316000080
- By:
- Publication type:
- Article
Perfect Packings in Quasirandom Hypergraphs II.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 4, p. 595, doi. 10.1017/S0963548315000267
- By:
- Publication type:
- Article
On the Chromatic Thresholds of Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 2, p. 172, doi. 10.1017/S0963548315000061
- By:
- Publication type:
- Article
Counting Independent Sets in Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 2014, v. 23, n. 4, p. 539, doi. 10.1017/S0963548314000182
- By:
- Publication type:
- Article
The Turán Number of F3,3.
- Published in:
- Combinatorics, Probability & Computing, 2012, v. 21, n. 3, p. 451, doi. 10.1017/S0963548311000678
- By:
- Publication type:
- Article
Erdős-Ko-Rado in Random Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 2009, v. 18, n. 5, p. 629, doi. 10.1017/S0963548309990253
- By:
- Publication type:
- Article
Simplex Stability.
- Published in:
- Combinatorics, Probability & Computing, 2009, v. 18, n. 3, p. 441, doi. 10.1017/S0963548309009705
- By:
- Publication type:
- Article
When is an Almost Monochromatic K4Guaranteed?
- Published in:
- Combinatorics, Probability & Computing, 2008, v. 17, n. 6, p. 823, doi. 10.1017/S0963548308009413
- By:
- Publication type:
- Article
Rainbow Turán Problems.
- Published in:
- Combinatorics, Probability & Computing, 2007, v. 16, n. 1, p. 109, doi. 10.1017/S0963548306007760
- By:
- Publication type:
- Article
Polynomial to exponential transition in Ramsey theory.
- Published in:
- Proceedings of the London Mathematical Society, 2021, v. 122, n. 1, p. 69, doi. 10.1112/plms.12320
- By:
- Publication type:
- Article
Coloring unions of nearly disjoint hypergraph cliques.
- Published in:
- Mathematika, 2024, v. 70, n. 1, p. 1, doi. 10.1112/mtk.12234
- By:
- Publication type:
- Article
THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION.
- Published in:
- Mathematika, 2019, v. 65, n. 3, p. 702, doi. 10.1112/S0025579319000135
- By:
- Publication type:
- Article
Hypergraph Ramsey numbers of cliques versus stars.
- Published in:
- Random Structures & Algorithms, 2023, v. 63, n. 3, p. 610, doi. 10.1002/rsa.21155
- By:
- Publication type:
- Article
Independent sets in hypergraphs omitting an intersection.
- Published in:
- Random Structures & Algorithms, 2022, v. 61, n. 3, p. 493, doi. 10.1002/rsa.21071
- By:
- Publication type:
- Article
Hamilton cycles in quasirandom hypergraphs.
- Published in:
- Random Structures & Algorithms, 2016, v. 49, n. 2, p. 363, doi. 10.1002/rsa.20638
- By:
- Publication type:
- Article
List coloring triangle-free hypergraphs.
- Published in:
- Random Structures & Algorithms, 2015, v. 47, n. 3, p. 487, doi. 10.1002/rsa.20552
- By:
- Publication type:
- Article
The poset of hypergraph quasirandomness.
- Published in:
- Random Structures & Algorithms, 2015, v. 46, n. 4, p. 762, doi. 10.1002/rsa.20521
- By:
- Publication type:
- Article
On independent sets in hypergraphs.
- Published in:
- Random Structures & Algorithms, 2014, v. 44, n. 2, p. 224, doi. 10.1002/rsa.20453
- By:
- Publication type:
- Article
Coloring H-free hypergraphs.
- Published in:
- Random Structures & Algorithms, 2010, v. 36, n. 1, p. 11, doi. 10.1002/rsa.20298
- By:
- Publication type:
- Article
On the chromatic number of set systems.
- Published in:
- Random Structures & Algorithms, 2001, v. 19, n. 2, p. 87, doi. 10.1002/rsa.1020
- By:
- Publication type:
- Article
Ordered and Convex Geometric Trees with Linear Extremal Function.
- Published in:
- Discrete & Computational Geometry, 2020, v. 64, n. 2, p. 324, doi. 10.1007/s00454-019-00149-z
- By:
- Publication type:
- Article
DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS.
- Published in:
- Journal of Symbolic Logic, 2019, v. 84, n. 4, p. 1293, doi. 10.1017/jsl.2019.52
- By:
- Publication type:
- Article
Forbidding Complete Hypergraphs as Traces.
- Published in:
- Graphs & Combinatorics, 2007, v. 23, n. 6, p. 667, doi. 10.1007/s00373-007-0755-7
- By:
- Publication type:
- Article
Set-Coloring Ramsey Numbers via Codes.
- Published in:
- Studia Scientiarum Mathematicarum Hungarica, 2024, v. 61, n. 1, p. 1, doi. 10.1556/012.2023.04302
- By:
- Publication type:
- Article
On a generalized Erdős–Rademacher problem.
- Published in:
- Journal of Graph Theory, 2022, v. 100, n. 1, p. 101, doi. 10.1002/jgt.22768
- By:
- Publication type:
- Article
On the Size-Ramsey Number of Hypergraphs.
- Published in:
- Journal of Graph Theory, 2017, v. 86, n. 1, p. 104, doi. 10.1002/jgt.22115
- By:
- Publication type:
- Article
Coloring Triple Systems with Local Conditions.
- Published in:
- Journal of Graph Theory, 2016, v. 81, n. 3, p. 307, doi. 10.1002/jgt.21876
- By:
- Publication type:
- Article
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs.
- Published in:
- Journal of Graph Theory, 2014, v. 77, n. 1, p. 19, doi. 10.1002/jgt.21771
- By:
- Publication type:
- Article
On Generalized Ramsey Numbers for 3-Uniform Hypergraphs.
- Published in:
- Journal of Graph Theory, 2014, v. 76, n. 3, p. 217, doi. 10.1002/jgt.21760
- By:
- Publication type:
- Article
Books Versus triangles.
- Published in:
- Journal of Graph Theory, 2012, v. 70, n. 2, p. 171, doi. 10.1002/jgt.20607
- By:
- Publication type:
- Article
On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 2, p. 113
- By:
- Publication type:
- Article
Ramsey numbers and the Zarankiewicz problem.
- Published in:
- Bulletin of the London Mathematical Society, 2024, v. 56, n. 6, p. 2014, doi. 10.1112/blms.13040
- By:
- Publication type:
- Article
New lower bounds for hypergraph Ramsey numbers.
- Published in:
- Bulletin of the London Mathematical Society, 2018, v. 50, n. 2, p. 189, doi. 10.1112/blms.12133
- By:
- Publication type:
- Article
Hypergraph Ramsey numbers: tight cycles versus cliques.
- Published in:
- Bulletin of the London Mathematical Society, 2016, v. 48, n. 1, p. 127, doi. 10.1112/blms/bdv084
- By:
- Publication type:
- Article
A note on pseudorandom Ramsey graphs.
- Published in:
- Journal of the European Mathematical Society (EMS Publishing), 2024, v. 26, n. 1, p. 153, doi. 10.4171/JEMS/1359
- By:
- Publication type:
- Article
The Erdős-Hajnal hypergraph Ramsey problem.
- Published in:
- Journal of the European Mathematical Society (EMS Publishing), 2020, v. 22, n. 4, p. 1247, doi. 10.4171/JEMS/944
- By:
- Publication type:
- Article
Constructions in Ramsey theory.
- Published in:
- Journal of the London Mathematical Society, 2018, v. 97, n. 2, p. 247, doi. 10.1112/jlms.12102
- By:
- Publication type:
- Article
Explicit constructions of triple systems for Ramsey–Turán problems.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 3, p. 211
- By:
- Publication type:
- Article
Constructions of bipartite graphs from finite geometries.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 1, p. 1
- By:
- Publication type:
- Article
How many disjoint 2-edge paths must a cubic graph have?
- Published in:
- Journal of Graph Theory, 2004, v. 45, n. 1, p. 57
- By:
- Publication type:
- Article
Large induced forests in sparse graphs.
- Published in:
- Journal of Graph Theory, 2001, v. 38, n. 3, p. 113, doi. 10.1002/jgt.1028
- By:
- Publication type:
- Article
The edge-bandwidth of theta graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 89, doi. 10.1002/1097-0118(200010)35:2<89::AID-JGT3>3.0.CO;2-A
- By:
- Publication type:
- Article
Multiple vertex coverings by specified induced subgraphs.
- Published in:
- Journal of Graph Theory, 2000, v. 34, n. 2, p. 180, doi. 10.1002/1097-0118(200006)34:2<180::AID-JGT7>3.0.CO;2-L
- By:
- Publication type:
- Article
Graphic sequences that have a realization with large clique number.
- Published in:
- Journal of Graph Theory, 2000, v. 34, n. 1, p. 20, doi. 10.1002/(SICI)1097-0118(200005)34:1<20::AID-JGT3>3.0.CO;2-V
- By:
- Publication type:
- Article
Connectivity and separating sets of cages.
- Published in:
- Journal of Graph Theory, 1998, v. 29, n. 1, p. 35, doi. 10.1002/(SICI)1097-0118(199809)29:1<35::AID-JGT4>3.0.CO;2-F
- By:
- Publication type:
- Article