Cover Image

Maximizing subgraph density in graphs of bounded degree and clique number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kirsch, Rachel
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C35
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximizing the number of stars in graphs with forbidden properties
by: Berikkyzy, Zhanar, et al.
Published: (2025)

On the maximum number of $r$-cliques in graphs free of complete $r$-partite subgraphs
by: Balogh, József, et al.
Published: (2024)

The number of edges in graphs with bounded clique number and circumference
by: Dou, Chunyang, et al.
Published: (2024)

On problems of Erdős and Baumann-Briggs on minimising the density of $s$-cliques in graphs with forbidden subgraphs
by: Bodnár, Levente, et al.
Published: (2026)

Maximizing subgraph counts in regular graphs
by: Lippner, Gabor, et al.
Published: (2026)

A tensor's spectral bound on the clique number
by: Liu, Chunmeng, et al.
Published: (2024)

Lower bounds on the independence number of a graph in terms of degrees
by: Harant, Jochen, et al.
Published: (2025)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

The saturation number for unions of four cliques
by: Li, Ruo-Xuan, et al.
Published: (2024)

Extremal graphs with minimum number of connected subgraphs in a given family
by: Pandey, Dinesh, et al.
Published: (2025)

Minimum saturated graphs for unions of cliques
by: Zhu, Wen-Han, et al.
Published: (2024)

A localized approach to generalized Turán problems
by: Kirsch, Rachel, et al.
Published: (2023)

Ore plus Turán
by: Dawkins, Aleyah, et al.
Published: (2023)

Ramsey sequences with bounded clique size
by: Aher, Abhishek Girish, et al.
Published: (2025)

Acyclic subgraphs of digraphs with high chromatic number
by: Yuster, Raphael
Published: (2025)

Universality for graphs with bounded density
by: Alon, Noga, et al.
Published: (2023)

Sufficient average degree conditions for the existence of large highly connected subgraphs
by: Krone, Maximilian
Published: (2025)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

Induced rational exponents and bipartite subgraphs in $K_{s, s}$-free graphs
by: Dong, Zichao, et al.
Published: (2025)

Ramsey numbers for regular induced subgraphs
by: Dyson, Paul W., et al.
Published: (2026)

A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, et al.
Published: (2024)

Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
by: Yuan, Xiaoli, et al.
Published: (2023)

Turán number of four vertex-disjoint cliques
by: Kostochka, Alexandr, et al.
Published: (2025)

The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Induced subgraph density. III. Cycles and subdivisions
by: Nguyen, Tung, et al.
Published: (2023)

Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
by: Nguyen, Tung, et al.
Published: (2023)

Sharp bounds for covering with large cliques and independent sets
by: Bitonti, Veronica, et al.
Published: (2026)

A lower bound on the saturation number and a strengthening for triangle-free graphs
by: Buchanan, Calum, et al.
Published: (2024)

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
by: Attwa, Yamaan, et al.
Published: (2026)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below
by: Jiang, Zilin, et al.
Published: (2021)

Rational exponents for cliques
by: English, Sean, et al.
Published: (2024)

Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
by: Berger, Sören, et al.
Published: (2022)

Extremal problems for star forests and cliques
by: Lu, Yongchun, et al.
Published: (2024)

Positive co-degree densities and jumps
by: Balogh, József, et al.
Published: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

Solution to a problem of Katona on counting cliques of weighted graphs
by: Borg, Peter, et al.
Published: (2022)

On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)

The index of unbalanced signed complete graphs whose negative-edge-induced subgraph is ${K}_{2,2}$-minor free
by: Qin, Mingsong, et al.
Published: (2025)