:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kim, Jaehoon, Lee, Hyunwoo
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2401.02214
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the order of intersecting hypergraphs
by: Cambie, Stijn, et al.
Published: (2025)

Transversal cycles and paths in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Hamilton transversals in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2023)

On a rainbow extremal problem for color-critical graphs
by: Chakraborti, Debsoumya, et al.
Published: (2022)

Blowups of triangle-free graphs
by: Girão, António, et al.
Published: (2024)

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
by: Draganić, Nemanja, et al.
Published: (2025)

On the evolution of structure in triangle-free graphs
by: Jenssen, Matthew, et al.
Published: (2023)

On a Ramsey--Turán variant of Roth's theorem
by: Bucić, Matija, et al.
Published: (2025)

On the size of universal graphs for spanning trees
by: Kim, Jaehoon, et al.
Published: (2025)

List colouring triangle free planar graphs
by: Hu, Jianzhang, et al.
Published: (2019)

Connectivity keeping trees in triangle-free graphs
by: Chu, Hojin, et al.
Published: (2025)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

On the chromatic number of random triangle-free graphs
by: Mizgerd, Clayton, et al.
Published: (2025)

11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)

Suns in triangle-free graphs of large chromatic number
by: Hajebi, Sepehr, et al.
Published: (2025)

$n^2 + 1$ unit equilateral triangles cannot cover an equilateral triangle of side $> n$ if all triangles have parallel sides
by: Baek, Jineon, et al.
Published: (2023)

A note on edge colorings distinguishing all triangles in a graph
by: Pilsniak, Monika, et al.
Published: (2024)

Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)

Extremal triangle-free graphs with chromatic number at least four
by: Ren, Sijie, et al.
Published: (2024)

The strong fractional choice number of triangle-free planar graphs
by: Hu, Xiaolan, et al.
Published: (2026)

On Vizing's problem for triangle-free graphs
by: Kang, Ross J., et al.
Published: (2023)

The maximum number of triangles in $K_{1,s,t}$-free graphs
by: Calbet, Asier, et al.
Published: (2025)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

Three-coloring triangle-free graphs without long forbidden paths
by: Zhou, Yidong, et al.
Published: (2025)

Coloring triangles in graphs
by: Basu, Ayush, et al.
Published: (2024)

Partitioning triangle-free planar graphs into a forest and a linear forest
by: Liu, Guanwu, et al.
Published: (2025)

Spectral extremal results for triangle-free graphs with chromatic number at least four
by: Zhu, Yinfen, et al.
Published: (2026)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

Counting triangles in regular graphs
by: He, Jialin, et al.
Published: (2023)

On the 3-colorability of triangle-free and fork-free graphs
by: Schroeder, Joshua, et al.
Published: (2021)

$λ$-matchability in cubic graphs
by: Raghul, Santhosh, et al.
Published: (2025)

Spanning clique subdivisions in pseudorandom graphs
by: Lee, Hyunwoo, et al.
Published: (2025)

Almost all $C_k$-free oriented graphs have $Θ(n)$ backwards edges
by: Liu, Jianxi, et al.
Published: (2026)

On the number of triangles in $K_4$-free graphs
by: He, Jialin, et al.
Published: (2025)

Eigenvalues and triangles in graphs
by: Lin, Huiqiu, et al.
Published: (2019)

Some remarks on Folkman graphs for triangles
by: Mulrenin, Eion
Published: (2025)

On high discrepancy $1$-factorizations of complete graphs
by: Ai, Jiangdong, et al.
Published: (2025)

A note on transformations of edge colorings of chordless graphs and triangle-free graphs
by: Asratian, Armen
Published: (2024)

Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Random matchings in linear hypergraphs
by: Lee, Hyunwoo
Published: (2024)