Results 31 to 40 of about 24,814 (240)
A proof of the stability of extremal graphs, Simonovits' stability from Szemer\'edi's regularity [PDF]
, 2015 The following sharpening of Tur\'an's theorem is proved. Let $T_{n,p}$ denote the complete $p$--partite graph of order $n$ having the maximum number of edges. If $G$ is an $n$-vertex $K_{p+1}$-free graph with $e(T_{n,p})-t$ edges then there exists an (at
Füredi, Zoltán
core +2 more sources
Supersaturation and stability for forbidden subposet problems [PDF]
, 2015 We address a supersaturation problem in the context of forbidden subposets. A family $\mathcal{F}$ of sets is said to contain the poset $P$ if there is an injection $i:P \rightarrow \mathcal{F}$ such that $p \le_P q$ implies $i(p) \subset i (q)$.
Patkos, Balazs
core +5 more sources
Minimum Number of k-Cliques in Graphs with Bounded Independence Number [PDF]
, 2013 Erdos asked in 1962 about the value of f(n,k,l), the minimum number of k-cliques in a graph of order n and independence number less than l. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all large n) when (k,l) is (3,4), (3,5),
Pikhurko, Oleg, Vaughan, Emil R.
core +2 more sources
A Survey of Maximal k-Degenerate Graphs and k-Trees
Theory and Applications of GraphsThis article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj +1 more source
Optimal transportation, topology and uniqueness [PDF]
, 2010 The Monge-Kantorovich transportation problem involves optimizing with respect to a given a cost function. Uniqueness is a fundamental open question about which little is known when the cost function is smooth and the landscapes containing the goods to be
Ahmad, Najma +2 more
core +4 more sources
Colouring set families without monochromatic k-chains
, 2019 A coloured version of classic extremal problems dates back to Erd\H{o}s and Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of 2-edge-colourings without monochromatic triangles. They conjectured that the answer is simply given
Das, Shagnik +3 more
core +1 more source
Advanced Engineering Materials, EarlyView.This article provides an overview of recent advancements in bulk processing of rare‐earth‐free hard magnetic materials. It also addresses related simulation approaches at different scales. The research on rare‐earth‐free magnetic materials has increased significantly in recent years, driven by supply chain issues, environmental and social concerns, and
Daniel Scheiber, Andrea Bachmaier
wiley +1 more source
Weighted Asymmetry Index: A New Graph-Theoretic Measure for Network Analysis and Optimization
MathematicsGraph theory is a crucial branch of mathematics in fields like network analysis, molecular chemistry, and computer science, where it models complex relationships and structures.
Ali N. A. Koam +3 more
doaj +1 more source
Breaking Symmetries in Graph Representation [PDF]
, 2013 There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution.
Codish, M. +3 more
core
Advanced Engineering Materials, EarlyView.A wood‐based magnetic and conductive material called Magwood (MW), capable of blocking almost 99.99% of electromagnetic waves (in the X‐band frequency range), is synthesized using a simple, solvent‐free process. MW is lightweight, resists water, and is flame‐retardant, making it a promising alternative for shielding electronics. The rapid proliferation
Akash Madhav Gondaliya +3 more
wiley +1 more source